ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   7 346
16
20
11515 I AM VERY BUSY   78 3949
8
10
27271 Collecting Coins   56
9
17
27039 Assembly line   8 248
13
9
348 Expedition   15 860
15
20
5467 Finding password   3 161
28
34
5117 Wine trading in Gergovia   23 1868
6
11
26385 Harish and his rooks puzzle   76
9
1
132 Help R2-D2!   3 554
30
30
26651 Hydroelectric dams   7 311
16
16
19144 Digo plays with Numbers   6 573
10
13
3944 Bee Walk   13 1110
10
15
19686 Mining Camps   45
26
17
18965 Milk Scheduling   7 578
10
16
26649 Repair road   12 393
3
11
19320 Draw Skyline Graph   3 84
27
21
18273 Encode Integer   12 561
8
4
25309 Save Area 11   7 66
6
14

#greedy

The greedy approach - heuristic of making the locally optimal choice at each stage might be useful for this problem.

https://en.wikipedia.org/wiki/Greedy_algorithm