# 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 ≤ 105) that shows how many numbers are in Alex’s sequence.

The second line contains n integers a 1, a 2, …, a n (1 ≤ a i ≤ 105).

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

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cmath>
using namespace std;
int Comp(const void*a, const void*b)
{
return *(int*)b - *(int*)a;
}
long long max(long long a, long long b)
{
if (a > b)
{
return a;
}
return b;
}
long long a[100002] = { 0 };
long long b[100002] = { 0 };
int main()
{
int n, i;
cin >> n;
while (n--)
{
cin >> i;
a[i]++;
}
b[1] = a[1];
for (i = 2; i <= 100001; i++)
{
b[i] = max(b[i-1],b[i-2]+i*a[i]);
}
cout << b[100001];
return 0;
}

05-08 108

08-21 6418
09-10 3457
02-16 708