455A.md (1460B)
1 Source: https://codeforces.com/problemset/problem/455/A 2 3 A. Boredom 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 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. 22 23 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. 24 25 Alex is a perfectionist, so he decided to get as many points as possible. Help him. 26 27 Input 28 29 The first line contains integer *n* (1 ≤ *n* ≤ 105) that shows how many numbers are in Alex's sequence. 30 31 The second line contains *n* integers *a*1, *a*2, ..., *a**n* (1 ≤ *a**i* ≤ 105). 32 33 Output 34 35 Print a single integer — the maximum number of points that Alex can earn. 36 37 Examples 38 39 Input 40 41 ``` 42 2 43 1 2 44 ``` 45 46 Output 47 48 ``` 49 2 50 ``` 51 52 Input 53 54 ``` 55 3 56 1 2 3 57 ``` 58 59 Output 60 61 ``` 62 4 63 ``` 64 65 Input 66 67 ``` 68 9 69 1 2 1 3 2 2 2 2 3 70 ``` 71 72 Output 73 74 ``` 75 10 76 ``` 77 78 Note 79 80 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.