# codeforces 651B Beautiful Paintings（贪心）

There are n pictures delivered for the new exhibition. The i-th painting has beauty ai. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.

We are allowed to arranged pictures in any order. What is the maximum possible number of times the visitor may become happy while passing all pictures from first to last? In other words, we are allowed to rearrange elements of a in any order. What is the maximum possible number of indices i (1 ≤ i ≤ n - 1), such that ai + 1 > ai.

Input

The first line of the input contains integer n (1 ≤ n ≤ 1000) — the number of painting.

The second line contains the sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai means the beauty of the i-th painting.

Output

Print one integer — the maximum possible number of neighbouring pairs, such that ai + 1 > ai, after the optimal rearrangement.

Sample Input

Input
5
20 30 10 50 40

Output
4

Input
4
200 100 100 200

Output

2

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int n,i,j,sum,ans,a[1010],b[1010];
while(~scanf("%d",&n))
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
memset(b,0,sizeof(b));
sum=ans=0;
while(sum<n)
{
for(i=0;i<n;i++)
{
if(!b[i])
{
b[i]=1;
sum++;
break;
}
}
for(j=i+1;j<n;j++)
{
if(!b[j]&&a[j]>a[i])
{
b[j]=1;
ans++;
sum++;
i=j;
}
}
}
printf("%d\n",ans);
}
return 0;
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：codeforces 651B Beautiful Paintings（贪心） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)