B. Making a String_makin string-CSDN博客

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.

   Sample test(s) 
 
     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".

解题说明：此题要求是构造长度最长的字符串，其中每个字母出现的次数不能相同，并且也不能超过某个最大值。容易想到的方法是贪心，先保证出现次数最多的字母，然后依次递减，最后进行求和。

#include<cstdio>
#include <cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main()
{
	int i,n,a[100000];
	long long sum = 0;
	cin >> n;
	for(i=0; i<n; i++) 
	{
		cin >> a[i];
	}
	sort(a,a+n);
	for( i=n-2; i>=0; i--)
	{
		if(a[i] >= a[i + 1])
		{
			a[i] = max(a[i+1] - 1,0);
		}
	}
	for(i=0; i< n; i++)
	{
		sum+=a[i];
	}
	cout << sum<<endl;
	return 0;
}