ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   7 326
16
20
11515 I AM VERY BUSY   69 3610
8
10
27271 Collecting Coins   55
1
17
27039 Assembly line   6 191
13
8
348 Expedition   13 824
16
21
5467 Finding password   3 155
28
34
5117 Wine trading in Gergovia   19 1755
7
11
26385 Harish and his rooks puzzle   46
132 Help R2-D2!   3 540
30
30
26651 Hydroelectric dams   6 281
17
17
19144 Digo plays with Numbers   5 561
12
15
3944 Bee Walk   10 1079
11
15
19686 Mining Camps   41
17
1
18965 Milk Scheduling   7 551
10
16
26649 Repair road   11 355
3
10
19320 Draw Skyline Graph   2 78
21
13
18273 Encode Integer   12 541
8
4
25309 Save Area 11   7 63
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