ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   7 383
16
20
11515 I AM VERY BUSY   91 4655
9
10
27271 Collecting Coins   80
9
17
34501 Divisible Strings   3 60
17
21
27039 Assembly line   12 289
14
11
348 Expedition   20 961
15
21
5467 Finding password   5 164
24
34
5117 Wine trading in Gergovia   25 2120
6
11
34275 Game Store   2 50
7
5
26385 Harish and his rooks puzzle   101
9
1
132 Help R2-D2!   3 591
27
24
26651 Hydroelectric dams   7 374
16
16
19144 Digo plays with Numbers   7 598
10
13
3944 Bee Walk   13 1189
10
15
19686 Mining Camps   1 51
17
17
18965 Milk Scheduling   7 645
10
16
34025 Palindrome Maker   2 40
17
17
26649 Repair road   15 490
5
12
19320 Draw Skyline Graph   3 87
27
21
18273 Encode Integer   12 589
8
4
25309 Save Area 11   7 80
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