B - Making a String-----CodeForces 624B

B - Making a String

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

Submit  Status  Practice  CodeForces 624B

Description

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 a_i 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 a_i (1 ≤ a_i ≤ 10⁹) — 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.

Sample Input

Input

3
2 5 5

Output

11

Input

3
1 1 2

Output

3

Hint

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".

题意：给n个数量的字母，每个字母给定一个最高数量，要求组成一个最长的字符串，且字符串中每个字母的数量不能相同，求最长的字符串的字母总数

思路：将给的字母排序，然后从最高的开始累加，如果有相等的就--，直到比上一个小1.

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <list>
#include <vector>
#define ll long long
using namespace std;
/// ¾ÆÊÇ¿àµÄ£¬ÈËÊÇÔ뵀 
bool cmp(const ll a,const ll b){
	return a > b;
}
int main(int argc, char *argv[]) {
	int n;
	ll ans = 0;
	int a[30];
	cin>>n;
	a[0] = 0;
	for(int i = 1; i <= n; ++i)
		cin>>a[i];
	sort(a+1,a+1+n,cmp);
	ans += a[1];
    for(int i = 2; i <= n; ++i){
    	while(a[i] >= a[i-1]) a[i]--;
    	ans += max(a[i],0);
    }
    printf("%I64d\n",ans);
	return 0;
}