ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   7 319
16
20
11515 I AM VERY BUSY   65 3522
8
11
27271 Collecting Coins   52
1
17
27039 Assembly line   6 189
13
8
348 Expedition   13 813
16
21
5467 Finding password   3 155
28
34
5117 Wine trading in Gergovia   18 1731
6
12
26385 Harish and his rooks puzzle   40
132 Help R2-D2!   3 539
30
30
26651 Hydroelectric dams   6 280
17
17
19144 Digo plays with Numbers   5 558
12
15
3944 Bee Walk   10 1070
11
15
19686 Mining Camps   40
17
1
18965 Milk Scheduling   7 543
10
16
26649 Repair road   11 345
3
10
19320 Draw Skyline Graph   2 78
21
13
18273 Encode Integer   12 536
8
4
25309 Save Area 11   6 62
4
13

#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