ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   7 361
16
20
11515 I AM VERY BUSY   82 4122
8
10
27271 Collecting Coins   58
9
17
27039 Assembly line   8 259
13
9
348 Expedition   15 887
15
20
5467 Finding password   4 162
26
34
5117 Wine trading in Gergovia   23 1937
6
11
26385 Harish and his rooks puzzle   85
9
1
132 Help R2-D2!   3 568
27
24
26651 Hydroelectric dams   7 320
16
16
19144 Digo plays with Numbers   7 589
10
13
3944 Bee Walk   13 1130
10
15
19686 Mining Camps   48
26
17
18965 Milk Scheduling   7 607
10
16
34025 Palindrome Maker   1 13
26649 Repair road   12 414
3
11
19320 Draw Skyline Graph   3 85
27
21
18273 Encode Integer   12 577
8
4
25309 Save Area 11   7 68
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