ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   7 338
16
20
11515 I AM VERY BUSY   74 3788
8
10
27271 Collecting Coins   55
1
17
27039 Assembly line   7 201
13
9
348 Expedition   14 836
16
21
5467 Finding password   3 156
28
34
5117 Wine trading in Gergovia   21 1818
6
11
26385 Harish and his rooks puzzle   66
9
1
132 Help R2-D2!   3 545
30
30
26651 Hydroelectric dams   7 302
16
16
19144 Digo plays with Numbers   6 567
10
13
3944 Bee Walk   12 1101
11
15
19686 Mining Camps   43
17
1
18965 Milk Scheduling   7 568
10
16
26649 Repair road   12 377
3
11
19320 Draw Skyline Graph   2 81
21
13
18273 Encode Integer   12 553
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