A. Boredom

A. Boredom

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.

Given a sequence a consisting of n integers. The player can make several steps. In a single step he can choose an element of the sequence (let's denote it ak) and delete it, at that all elements equal to ak + 1 and ak - 1 also must be deleted from the sequence. That step brings ak points to the player.

Alex is a perfectionist, so he decided to get as many points as possible. Help him.

Input

The first line contains integer n (1 ≤ n ≤ 105) that shows how many numbers are in Alex's sequence.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 105).

Output

Print a single integer — the maximum number of points that Alex can earn.

Sample test(s)

input

2
1 2

output

2

input

3
1 2 3

output

4

input

9
1 2 1 3 2 2 2 2 3

output

10

Note

Consider the third test example. At first step we need to choose any element equal to 2. After that step our sequence looks like this [2, 2, 2, 2]. Then we do 4 steps, on each step we choose any element equals to 2. In total we earn 10 points.

题解：由题意可知，对于数列中的一个数i来说，其得分为i*cot[i]（cot[i]为i这个数出现的次数），而且建立在i-1和i+1不取的情况下（冥冥之中感觉到是动归）。而且我们可以发现最佳得分方案只与取哪些数有关而与取得顺序无关，所以我们可以假定从1一直决策到n，最后F[N]就是最最终解。讲了这么多，以下是DP方程：

F[i]=max( F[i-1],F[i-2]*cot[i] )

F[i]是从一取到i时的最大得分（i一定取），这样F[i]就可以从F[i-1]（取了i-1）和F[i-2]（没取i-1）递推而来，很好想也很好理解的一个方程。

#include<iostream>
using namespace std;

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