Magical Bribery

View as PDF

Submit solution


Points: 7
Time limit: 2.0s
Memory limit: 64M

Authors:
Problem type

Anish has been having trouble in computer science, and is trying to bribe Mr. McKenzie to raise his mark. Now, since bribing Mr. Mckenzie with money obviously won’t work, Anish is going to use magic cards. Mr. Mckenzie places value on a certain amount of magic cards, for example 3 cards might have a value of 5, then 4 cards have a value of 6, and 6 cards could have a value of 12. Given how many cards Anish has, and how much Mr. Mckenzie values every amount of cards, print out the maximum value Anish can get for his cards.

Input Specifications

A number N (1 \le N \le 1000) for how many cards Anish has, and on the next N lines, a number N_i (N_i \ge 1) which represents how much Mr. Mckenzie values a package of i cards.

Output Specifications

The maximum value Anish can get for his cards.

Sample Input

8
6
15
18
22
25
51
51
59

Sample Output

66

Comments

There are no comments at the moment.