ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   7 375
16
20
11515 I AM VERY BUSY   89 4431
9
10
27271 Collecting Coins   80
9
17
34501 Divisible Strings   1 17
9
9
27039 Assembly line   11 276
14
11
348 Expedition   20 917
16
21
5467 Finding password   5 164
24
34
5117 Wine trading in Gergovia   23 2058
6
11
34275 Game Store   29
6
6
26385 Harish and his rooks puzzle   94
9
1
132 Help R2-D2!   3 573
27
24
26651 Hydroelectric dams   7 349
16
16
19144 Digo plays with Numbers   7 597
10
13
3944 Bee Walk   13 1169
10
15
19686 Mining Camps   1 50
17
17
18965 Milk Scheduling   7 629
10
16
34025 Palindrome Maker   2 38
17
17
26649 Repair road   14 471
2
10
19320 Draw Skyline Graph   3 87
27
21
18273 Encode Integer   12 585
8
4
25309 Save Area 11   7 76
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