codeforces Boredom 455A dp

A. Boredom

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 a_k) and delete it, at that all elements equal to a_k + 1 and a_k - 1 also must be deleted from the sequence. That step brings a_k 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 ≤ 10⁵) that shows how many numbers are in Alex's sequence.

The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁵).

Output

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

Examples

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.

题目大意：

每次抽取一个数字 num　然后从整个数组中去除　　所有　num-1 num+1　不断取数　最终　将所有num加起来　求这个和最大是多少

题目思路：这道题本来没想要取dp前ｎ项最大和　然后发现不对　去看了一波题解　发现这道题和普通的dp不一样

他是dp　从　1     到   100005　　以这些数构造dp数组 因为所有输入的数字都满足 1<=num <=100005

然后模拟一组数据

9
1 2 1 3 2 2 2 2 3

因为dp特性　只向前考虑　即每次考虑　我只用考虑　num-1即可 　即每次取数　我要么选择　前一项num-1　则当前项　num无法选取　要么　取　num-2项　则　当前项　

num能取　所以我的dp式子应该是 dp[i]= max(dp[i-1]   , dp[i-2]+当前项＊当前项出现次数)

所以　模拟出来　是舍弃　1 1   和　  3 3　选择 2 2 2 2 2

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int MAXN=1e5+5;  //极大值
ll dp[MAXN];
int main()
{
    int n;
    while(scanf("%d",&n)==1)
    {
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
        {
            int tmp;
            scanf("%d",&tmp);
            dp[tmp]++;　　　//用dp来存储　当前项出现次数 可以用另外一个数组来开
        }

        for(int i=2;i<MAXN;i++)
        {
            dp[i]=max(dp[i-1],dp[i-2]+i*dp[i]);　　　
        }
        printf("%lld\n",dp[MAXN-1]);
    }
}

总结　dp也可以对每一个数字进行考虑