Codeforces Round #304 (Div. 2) B.Soldier and Badges

time limit per test3 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

Colonel has n badges. He wants to give one badge to every of his n soldiers. Each badge has a coolness factor, which shows how much it’s owner reached. Coolness factor can be increased by one for the cost of one coin.

For every pair of soldiers one of them should get a badge with strictly higher factor than the second one. Exact values of their factors aren’t important, they just need to have distinct factors.

Colonel knows, which soldier is supposed to get which badge initially, but there is a problem. Some of badges may have the same factor of coolness. Help him and calculate how much money has to be paid for making all badges have different factors of coolness.

Input
First line of input consists of one integer n (1 ≤ n ≤ 3000).

Next line consists of n integers ai (1 ≤ ai ≤ n), which stand for coolness factor of each badge.

Output
Output single integer — minimum amount of coins the colonel has to pay.

Sample test(s)
input
4
1 3 1 4
output
1
input
5
1 2 3 2 5
output
2
Note
In first sample test we can increase factor of first badge by 1.

In second sample test we can increase factors of the second and the third badge by 1.

这道题的意思是得到一组数据，数据里面可能有相同的数字，要做的就是把相同的数字不断往后面推，也就是变大，直到每个数字都不相同。

这道题WA了好久，刚开始是不知道能不能把数字变小，后来才知道原来是把相同的数字不断往后推，直到所有的数字都是不同的，然后又超时，所以选择了把输入的数字当做下标的方法，然后A了

#include<iostream>
#include<string.h>
using namespace std;
int b[6010];
int main()
{
    int n;
    while(cin>>n)
    {
        int small=3010;
        int big=0;
        int flag=0;
        int count=0;
        for(int i=0;i<n;i++)
        {
            int nut;
            cin>>nut;
            b[nut]++;
            big=big>nut?big:nut;
            small=small<nut?small:nut;
        }
        int k=small;
        while(k<=n)
        {
            if(b[k]>1)
            {
                int ans=k+1;
                while(ans<=n)
                {
                    if(b[ans]==0)
                    {
                        b[k]--;
                        b[ans]++;
                        flag+=ans-k;
                        k=small;
                        ans=n;
                        count=1;
                    }
                    ans++;
                }
                if(count==0)
                {
                    big++;
                    b[big]++;
                    b[k]--;
                    flag+=big-k;
                    k=small;
                    count=1;
                }
            }
            if(count==0)  k++;
            else  count=0;
        }
        cout<<flag<<endl;
        memset(b,0,sizeof(b));
    }
    return 0;
}