CodeForces 455A Boredom (dp)

A - Boredom

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

Submit  Status  Practice  CodeForces 455A

Appoint description:  System Crawler  (Jul 20, 2016 9:07:30 PM)

Description

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

Sample Input

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

Hint

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.

题意:给出一个序列，从序列中取数，如果取a,则不能取a+1,a-1,问能取到得数的最大和。

思路：DP问题。取或者不取

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
__int64 a[110000],dp[110000];
int main()
{
	__int64 n,i,j,k,l,m;
	while(scanf("%I64d",&n)!=EOF)
	{
		memset(a,0,sizeof(a));
		memset(dp,0,sizeof(dp));
		int flag=0;
		for(i=0;i<n;i++)
		{
			scanf("%I64d",&m);
			a[m]++;
			if(m>flag)
			flag=m;
		}
	    dp[1]=a[1];
		for(i=2;i<=flag;i++)
		{
			dp[i]=max(dp[i-1],a[i]*i+dp[i-2]);
		}
		printf("%I64d\n",dp[flag]);
	}
	return 0;
}