Algorithm


C. 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 a1a2, ..., an (1 ≤ ai ≤ 105).

Output

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

Examples
input
Copy
2
1 2
output
Copy
2
input
Copy
3
1 2 3
output
Copy
4
input
Copy
9
1 2 1 3 2 2 2 2 3
output
Copy
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.



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <stdio.h>
#include <vector>
#include <algorithm>
#include <memory.h>

using namespace std;

int const N = 1e5 + 1;
int n, freq[N];
long long dp [N];

long long calc(int val) { 
    if(val >= N) return 0;
    
    long long &ret = dp[val];
    if(ret != -1) return ret;
    ret = 0;
    
    ret = max(ret, calc(val + 2) + (1LL * freq[val] * val));
    ret = max(ret, calc(val + 1));
    
    return ret;
}

int main() {
    scanf("%d", &n);
    int tmp;
    for(int i = 0; i < n; i++) {
        scanf("%d", &tmp);
	freq[tmp]++;
    }
    
    memset(dp, -1, sizeof dp);
    printf("%lld\n", calc(0));
    return 0;
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
2
1 2

Output

x
+
cmd
2
Advertisements

Demonstration


Codeforces Solution-Boredom-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+