codeforces 546B Soldier and Badges

最新推荐文章于 2022-03-23 19:53:35 发布

原创最新推荐文章于 2022-03-23 19:53:35 发布 · 498 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#水题

ACM算法_水题专栏收录该内容

76 篇文章

订阅专栏

本文介绍了一个算法问题，即如何最小化成本使每个士兵拥有的勋章酷值各不相同。通过输入勋章初始酷值并进行适当调整，确保每枚勋章的酷值都是唯一的。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

点击打开链接

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.

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.

把数组改成各个数字不等，求最小改变的和，注意，只增，不减

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int mod=1000000000;
int main()
{
    int n;
    scanf("%d",&n);
    int s[3005],vis[9005];
    memset(vis,0,sizeof(vis));
    ll sum=0;
    for(int i=0; i<n; i++)
        scanf("%d",&s[i]);
    sort(s,s+n);
    for(int i=0; i<n; i++)
    {
        if(vis[s[i]]==0)
        {
            vis[s[i]]=1;
        }
        else
        {
            int k=s[i]+1;
            while(vis[k]==1)
            {
                k++;
            }
            vis[k]=1;
            sum+=k-s[i];
        }
    }
    cout<<sum<<endl;
    return 0;
}