ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   7 252
16
20
11515 I AM VERY BUSY   55 3188
8
11
27271 Collecting Coins   31
1
17
27039 Assembly line   6 176
13
8
348 Expedition   13 773
16
21
5467 Finding password   3 143
28
34
5117 Wine trading in Gergovia   17 1603
7
11
26385 Harish and his rooks puzzle   17
132 Help R2-D2!   3 533
30
30
26651 Hydroelectric dams   6 235
17
17
19144 Digo plays with Numbers   5 522
12
15
3944 Bee Walk   8 1026
12
17
19686 Mining Camps   40
17
1
18965 Milk Scheduling   4 446
13
20
26649 Repair road   10 280
3
10
19320 Draw Skyline Graph   2 61
21
13
18273 Encode Integer   10 506
9
4
25309 Save Area 11   4 54
1
17

#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