Codeforces-B.Soldier and Badges - Codeforces Round #304 (Div. 2)
来源:互联网 发布:如何用python做贪吃蛇 编辑:程序博客网 时间:2024/05/04 10:46
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.
Examples
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.
题解:对序列进行排序,因为数字只能增大或不变,为保证每个数都不一样,那么后一个一定要比前一个大,把每个数最少的增加量累加起来就是结果。
#include<iostream>#include<algorithm>using namespace std;int main(){ int a[3010]; int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); int sumcoin = 0; int coin; //coin为当前需要花费的最少金币个数 for (int i = 1; i < n; i++) { if (a[i-1] < a[i]) coin = 0; else { coin = a[i-1] - a[i] + 1; a[i] += coin; } sumcoin += coin; } cout << sumcoin << endl; return 0;}
- Codeforces-B.Soldier and Badges - Codeforces Round #304 (Div. 2)
- Codeforces Round #304 (Div. 2) B.Soldier and Badges
- B - Soldier and Badges (CF546B) Codeforces Round #304 (Div. 2)
- CodeForces-546B-Soldier and Badges
- 【codeforces 546B】Soldier and Badges
- codeforces 546B Soldier and Badges
- Codeforces Round #304 (Div. 2) E. Soldier and Traveling
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game
- Codeforces Round #304 (Div. 2) C Soldier and Cards
- Codeforces Round #304 (Div. 2) D Soldier and Number Game
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game
- A. Soldier and Bananas(CF546) Codeforces Round #304 (Div. 2)
- E. Soldier and Traveling(CF546E) Codeforces Round #304 (Div. 2)
- Codeforces Round #304 (Div. 2) D - Soldier and Number Game
- Codeforces Round #304 (Div. 2)D. Soldier and Number Game
- Codeforces Round #304 (Div. 2)-E. Soldier and Traveling
- CodeForces 546B - Soldier and Badges(模拟)
- B. Soldier and Badges
- 2016--07--23
- AtCoder Regular Contest 058 C (水题)
- ---Jsp(六)标签
- Codeforces #362(Div.2)-> E.PLEASE(快速幂+费马小定理)
- JDNI配置数据库连接池
- Codeforces-B.Soldier and Badges - Codeforces Round #304 (Div. 2)
- JAVA集合体系回顾
- JAVA面向对象-----抽象类
- HDU3507 Print Article
- PAT (Basic Level) Practise-1016
- 四大组件之Activity
- 初窥渗透--IIS6.0解析漏洞
- 码神学习作业(数组)
- 把一个字符串的大写字母放到字符串的后面,各个字符的相对位置不变,且不能申请额外的空间。