CodeForces - 467C
Description The new ITone 6 has been released recently and George got really keen to buy it. Unfortunately, he didn't have enough money, so George was going to work as a programmer. Now he faced the following problem at the work. Given a sequence of n integers p1, p2, ..., pn. You are to choose k pairs of integers: in such a way that the value of sum is maximal possible. Help George to cope with the task. Input The first line contains three integers n, m and k(1 ≤ (m × k) ≤ n ≤ 5000). The second line contains n integers p1, p2, ..., pn(0 ≤ pi ≤ 109). Output Print an integer in a single line — the maximum possible value of sum. Sample Input
Input
5 2 1 1 2 3 4 5
Output
9
Input
7 1 3 2 10 7 18 5 33 0
Output
61
|
CodeForces - 467C George and Job
最新推荐文章于 2020-01-23 19:29:44 发布