GlobeX Cup '18 J Sample - Farming Simulator

View as PDF

Submit solution

All submissions

Best submissions

Points: 5 (partial)

Time limit: 2.0s

Memory limit: 64M

Author:

Beautiful_Times

Problem type

Farmer Yunji owns $N$ $N$ farms. Each farm produces $X_i$ $X_{i}$ dollars per day. Due to tax issues, he has to sell $M$ $M$ of his farms. What is the maximum amount of money he can earn per day from his farms, after he sells $M$ $M$ of them?

Input Specification

The first line will contain two space-separated integers, $N, M$ $N, M$ $(1 \le M \le N \le 10^5)$ $(1 \leq M \leq N \leq 10^{5})$ , the number of farms, and the number of farms Yunji has to sell, respectively.

The next line will contain $N$ $N$ integers, $X_i$ $X_{i}$ $(1 \le X_i \le 10^5)$ $(1 \leq X_{i} \leq 10^{5})$ .

Output Specification

On the first line, output the maximum amount of money Yunji can make per day after selling $M$ $M$ of his farms.

Constraints

Subtask 1 [15%]

$M \le \min(50,N)$ $M \leq min (50, N)$

Subtask 2 [85%]

No additional constraints.

Sample Input 1

Copy

2 1
8 10

Sample Output 1

Copy

Sample Input 2

Copy

3 3
29 34 12

Sample Output 2

Copy

Comments

3

magicalsoup commented on Dec. 7, 2018, 11:34 p.m. ← edited →

guys, remember to use $2^{63}$ $2^{63}$ integer data type to store your sum, using normal $2^{31}$ $2^{31}$ integer data types is not enough for this question