ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   7 263
16
20
11515 I AM VERY BUSY   60 3326
8
11
27271 Collecting Coins   32
1
17
27039 Assembly line   6 177
13
8
348 Expedition   13 782
16
21
5467 Finding password   3 152
28
34
5117 Wine trading in Gergovia   17 1620
7
11
26385 Harish and his rooks puzzle   30
132 Help R2-D2!   3 535
30
30
26651 Hydroelectric dams   6 265
17
17
19144 Digo plays with Numbers   5 526
12
15
3944 Bee Walk   8 1034
12
17
19686 Mining Camps   40
17
1
18965 Milk Scheduling   6 460
11
17
26649 Repair road   10 319
3
10
19320 Draw Skyline Graph   2 59
21
13
18273 Encode Integer   11 513
8
4
25309 Save Area 11   5 59
1
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