ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   12 430
16
19
11515 I AM VERY BUSY   107 5220
9
11
27271 Collecting Coins   85
12
17
34501 Divisible Strings   5 82
15
17
27039 Assembly line   14 366
15
13
348 Expedition   25 1082
17
21
35337 Faketorial Hashing   1 0
34
34
5467 Finding password   5 168
24
34
5117 Wine trading in Gergovia   36 2336
8
12
34275 Game Store   3 91
6
6
26385 Harish and his rooks puzzle   1 122
9
1
132 Help R2-D2!   4 622
28
24
26651 Hydroelectric dams   8 491
16
16
19144 Digo plays with Numbers   7 622
10
13
3944 Bee Walk   14 1238
11
15
19686 Mining Camps   1 61
17
17
18965 Milk Scheduling   7 713
10
16
34025 Palindrome Maker   3 52
17
26
34975 Prime Friendly Numbers   5 15
30
26
26649 Repair road   17 613
6
13
19320 Draw Skyline Graph   3 90
27
21
18273 Encode Integer   13 618
9
5
25309 Save Area 11   8 88
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