codeforces546-Soldier and Badges(模拟)

最新推荐文章于 2020-01-17 16:58:33 发布

梧桐下的四叶草

最新推荐文章于 2020-01-17 16:58:33 发布

阅读量425

点赞数 1

分类专栏： codeforces 文章标签： codeforces 模拟

本文链接：https://blog.csdn.net/zsc2014030403015/article/details/50545555

版权

codeforces 专栏收录该内容

123 篇文章 1 订阅

订阅专栏

Soldier and Badges

Time Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 546B

Appoint description:

Description

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 a_i (1 ≤ a_i ≤ n), which stand for coolness factor of each badge.

Output

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

Sample Input

Input

4
1 3 1 4

Output

Input

5
1 2 3 2 5

Output

Hint

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.

题意：

这题的题意是将所有给出的数字都变成只有1-n的的数字要用多少次。

思路：

这题直接模拟，将相同的都加1处理，直到所有的数字都为1-n就结束。

AC代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<set>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
typedef unsigned __int64 LL;
typedef  __int64 ll;
const int T = 100010;
const int mod = 1000000007;

int a[T],c[T];
set<int> ve;

int main()
{
#ifdef zsc
    freopen("input.txt","r",stdin);
#endif

	int n,m,u,v,i,j,k;

	while(~scanf("%d",&n))
	{
		memset(c,0,sizeof(c));
		ve.clear();
		for(i=0;i<n;++i){
			scanf("%d",&a[i]);
			c[a[i]]++;
			if(c[a[i]]>1){
				ve.insert(a[i]);
			}
		}
		auto it = ve.begin();
		k=0;
		while(!ve.empty())
		{
			k++;
			it = ve.begin();
			c[*it]--;
			if(++c[*it+1]>1){
				ve.insert(*it+1);
			}
			if(c[*it]<=1)
			ve.erase(it);
		}
		printf("%d\n",k);
	}

    return 0;
}