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.
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 single integer — minimum amount of coins the colonel has to pay.
4
1 3 1 4
1
5
1 2 3 2 5
2
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.
Div2 B， 先排序，然后贪心修改：一样的时候元素+1
CODE:
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #define REP(i, s, n) for(int i = s; i <= n; i ++) #define REP_(i, s, n) for(int i = n; i >= s; i --) #define MAX_N 3000 + 10 using namespace std; int n, res = 0; int a[MAX_N]; int main(){ scanf("%d", &n); REP(i, 1, n) scanf("%d", &a[i]); sort(a + 1, a + n + 1); int last = -1; REP(i, 1, n){ if(last < a[i]) last = a[i]; else res += ++ last - a[i]; } printf("%d\n", res); return 0; }
原文：http://www.cnblogs.com/ALXPCUN/p/4545830.html