(？) Boredom（dp题）..

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.

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.
大意就是说 我输入一个n然后在输入n个数
然后我挑数，假设我挑n ，那么只要是大小等于n的，他们的和就是我的分数，之后删除大小等于n-1和n+1的数。
我还可以再继续操作。怎么得到最大的分数和

重点还是找到状态转移方程

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iomanip>
using namespace std;
long long a[100100], f[100100];//需要两个数组，f很关键，全都为零
int main()
{
	
	int m=0, n; cin >> n;
	int b;
	for (int i = 1; i <= n; i++)
	{
		cin >> b;
		if (b > m)m = b;
		a[b]++;
	}//这里表示的数组跟平常不一样，数组表示的个数，数组下表表示的数子，用来记录相同的某一个数出现的次数。
	//f用来表示我得到分数；
	f[0] = 0; f[1] =a[1];//下表是我选择的数，如果选0，得分为0，如果选择1，得分就是1的出现次数
	for (int i = 2; i <= m; i++)
	{
		f[i] = (f[i - 1] > (f[i - 2] + a[i] * i) ? f[i - 1] : (f[i - 2] + a[i] * i));
	}
	把最大值赋给i，然后依次往后删除，看看比max大的，再赋给f[i];

	cout << f[m];
}