codeforces #345 div 2 B. Beautiful Paintings （暴力）

 1/* ***********************************************
 2Author :111qqz
 3Created Time :2016年03月07日 星期一 17时06分48秒
 4File Name :code/cf/#345/B.cpp
 5************************************************ */
 6
 7#include <cstdio>
 8#include <cstring>
 9#include <iostream>
10#include <algorithm>
11#include <vector>
12#include <queue>
13#include <set>
14#include <map>
15#include <string>
16#include <cmath>
17#include <cstdlib>
18#include <ctime>
19#define fst first
20#define sec second
21#define lson l,m,rt<<1
22#define rson m+1,r,rt<<1|1
23#define ms(a,x) memset(a,x,sizeof(a))
24typedef long long LL;
25#define pi pair < int ,int >
26#define MP make_pair
27
28using namespace std;
29const double eps = 1E-8;
30const int dx4[4]={1,0,0,-1};
31const int dy4[4]={0,-1,1,0};
32const int inf = 0x3f3f3f3f;
33const int N=1E3+7;
34int n ;
35int a[N];
36int cnt[N];
37int num[N];
38int sum[N];
39int main()
40{
41	#ifndef  ONLINE_JUDGE 
42	freopen("code/in.txt","r",stdin);
43  #endif
44
45    cin>>n;
46    ms(cnt,0);
47    ms(num,0);
48    ms(sum,0);
49    for ( int i = 1 ; i <= n ; i++)
50    {
51	cin>>a[i];
52	cnt[a[i]]++;
53    }
54    if (n==1)
55    {
56	puts("0");
57	return 0 ;
58    }
59    if (n==2)
60    {
61	if (a[1]==a[2])
62	{
63	    puts("0");
64	}
65	else
66	{
67	    puts("1");
68	}
69	return 0;
70    }
71
72    int mx = -1;
73    for ( int i = 1 ; i <= 1000 ; i++)
74    {
75	num[cnt[i]]++;
76	mx = max(mx,cnt[i]);
77    }
78
79    for ( int i = mx ; i >= 1 ; i --)
80    {
81	sum[i] = sum[i+1]+num[i];
82    }
83
84    int ans = 0 ;
85    for ( int i = 1 ; i <= mx ; i++)
86    {
87	ans +=sum[i]-1;
88//	cout<<"sum[i]:"<<sum[i]<<endl;
89    }
90    cout<<ans<<endl;
91
92
93
94  #ifndef ONLINE_JUDGE  
95  fclose(stdin);
96  #endif
97    return 0;
98}