codeforces 624 B Making a String欲張りソート

B. Making a String
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given an alphabet consisting of n letters, your task is to make a string of the maximum possible length so that the following conditions are satisfied:
the i-th letter occurs in the string no more than ai times;
the number of occurrences of each letter in the string must be distinct for all the letters that occurred in the string at least once.
Input
The first line of the input contains a single integer n (2  ≤  n  ≤  26) — the number of letters in the alphabet.
The next line contains n integers ai (1 ≤ ai ≤ 109) — i-th of these integers gives the limitation on the number of occurrences of the i-th character in the string.
Output
Print a single integer — the maximum length of the string that meets all the requirements.
Examples
input

3
2 5 5

output

11

input

3
1 1 2

output

3

Note
For convenience let's consider an alphabet consisting of three letters: "a", "b", "c". In the first sample, some of the optimal strings are: "cccaabbccbb", "aabcbcbcbcb". In the second sample some of the optimal strings are: "acc", "cbc".
大きいものから小さいものまで並べ替えて、1つのmapで唯一表示して、マークしたことがあるのは絶えず1を減らして、この数まで減らして前に現れたことがなくて、累積して、順番に最後まで行います

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <map>

using namespace std;

int a[30];
map<int, int> m;

bool cmp(int x, int y) {
	return x > y;
}

int main()
{
	int n;
	while (~scanf("%d", &n)) {
		m.clear();
		for (int i = 0; i < n; i++) {
			scanf("%d", &a[i]);
		}
		sort(a, a + n, cmp);
		long long ans = 0;
		for (int i = 0; i < n; i++) {
			if (m[a[i]] == 0) {
				m[a[i]]++;
				ans += a[i];
			} else {
				while (a[i] > 0) {
					if (m[--a[i]] == 0) {
						m[a[i]]++;
						ans += a[i];
						break;
					}
				}
			}
		}
		printf("%I64d
", ans);
	}
	return 0;
}