CodeForces - 651B 一个简单的思考题，暴力也能过

There are n pictures delivered for the new exhibition. The i-th painting has beauty a_i. 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 a_i + 1 > a_i.

Input

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

The second line contains the sequence a₁, a₂, ..., a_n (1 ≤ a_i ≤ 1000), where a_i means the beauty of the i-th painting.

Output

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

Example

Input

5
20 30 10 50 40

Output

4

Input

4
200 100 100 200

Output

2

Note

In the first sample, the optimal order is: 10, 20, 30, 40, 50.

In the second sample, the optimal order is: 100, 200, 100, 200.

暴力：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[1005],b[1005];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a,a+n);
        int ans=0,m=1,x;
        memset(b,0,sizeof(b));
        while(m)//暴力寻找，直到找不到
        {
            m=0;x=0;
            for(int i=0;i<n;i++)//挨个找
            {
                if(!b[i]&&a[i]>x)//b数组用来标记，除非把b全标记为1，要不然不会停。
                {
                    b[i]=1;
                    x=a[i];
                    m++;
                }
            }
            if(m)//因为m记录的是每一次查找的个数
            {
                ans+=m-1;
            }
        }
        printf("%d\n",ans);
    }
}

其实，这道题只要是不同的两个数在一起就ans++，那么我们只要找的最多的相同的数，每次拿出来一个这样的数去配一个其他的数那么这样两个不同的数就符合要求，这样一来，我们只要知道除了最多相同数之外还有几个数就行了

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[1005];
int main()
{
    int n,x;
    while(~scanf("%d",&n))
    {
        int maxx=-1;
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++)
        {
            scanf("%d",&x);
            a[x]++;
            if(maxx<a[x])
                maxx=a[x];
        }
        printf("%d\n",n-maxx);
    }
}