CodeForces - 1008C ​​​​​​​Reorder the Array (思维)

Reorder the Array
You are given an array of integers. Vasya can permute (change order) its integers. He wants to do it so that as many as possible integers will become on a place where a smaller integer used to stand. Help Vasya find the maximal number of such integers.

For instance, if we are given an array [10,20,30,40], we can permute it so that it becomes [20,40,10,30]. Then on the first and the second positions the integers became larger (20>10, 40>20) and did not on the third and the fourth, so for this permutation, the number that Vasya wants to maximize equals 2. Read the note for the first example, there is one more demonstrative test case.

Help Vasya to permute integers in such way that the number of positions in a new array, where integers are greater than in the original one, is maximal.

Input
The first line contains a single integer n (1≤n≤105) — the length of the array.

The second line contains n integers a1,a2,…,an (1≤ai≤109) — the elements of the array.

Output
Print a single integer — the maximal number of the array's elements which after a permutation will stand on the position where a smaller element stood in the initial array.

Examples
Input
7
10 1 1 1 5 5 3
Output
4
Input
5
1 1 1 1 1
Output
0
Note
In the first sample, one of the best permutations is [1,5,5,3,10,1,1]. On the positions from second to fifth the elements became larger, so the answer for this permutation is 4.

In the second sample, there is no way to increase any element with a permutation, so the answer is 0.

 

题意：给你一个数组。允许你对这个数组进行任意序列的摆放。设 count = 0，如果操作后 对应位置的值 比之前 大，则 count ++.问 最后count 的最大值。

思路：对于一组没有重复元素的数组，我们知道 最大的值 为元素的个数 - 1   .... 故先记录数组的每一种元素的个数。然后对个数进行排序。如序列  1 1 2 2 2 3 3 3 4 4  .  进行以上操作后得到的 存个数的数组为   2 2 3 3 .  去重一次后 数组变为 0 0 1 1 .   故很显然答案就为 (4 - 1) * 2 + (2 - 1) = 7.   

AC代码：

#include<bits/stdc++.h>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define pii pair<int,int>
#define clr(a,b) memset((a),b,sizeof(a))
#define rep(i,a,b) for(int i = a;i < b;i ++)
#define pb push_back
#define MP make_pair
#define LL long long
#define INT(t) int t; scanf("%d",&t)
#define LLI(t) LL t; scanf("%I64d",&t)
 
using namespace std;
 
int main()
{
    int n;
    while(~scanf("%d",&n)){
        int k;
        map<int,int> mp;
        vector<int> v;
        rep(i,0,n){
            scanf("%d",&k);
            ++ mp[k];
        }
        map<int,int>::iterator it;
        for(it = mp.begin();it != mp.end();it ++)
            v.push_back((*it).second);
        sort(v.begin(),v.end());
        int ans = 0;
        int n = v.size() - 1;
        int last = 0;
        rep(i,0,v.size()){
            if(n == 0) break;
            //debug(n);
            ans += n * (v[i] - last);
            last = v[i];
            -- n;
            for(int j = i + 1;j < v.size();j ++)
                if(v[j] == v[i]){
                    -- n;
                    i = j;
                }
        }
        printf("%d\n",ans);
    }
    return 0;
}