ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   14 520
14
19
36670 Bipartite Permutation   10 178
6
16
36671 Bipartite Permutation (Hard)   5 47
29
31
11515 I AM VERY BUSY   137 6671
9
11
27271 Collecting Coins   2 99
11
21
34501 Divisible Strings   5 166
15
17
27039 Assembly line   16 405
16
14
348 Expedition   43 1464
19
20
35337 Faketorial Hashing   1 0
34
34
5467 Finding password   5 174
24
34
5117 Wine trading in Gergovia   50 2840
7
12
34275 Game Store   5 155
5
7
26385 Harish and his rooks puzzle   5 170
4
1
132 Help R2-D2!   12 714
22
18
26651 Hydroelectric dams   9 668
16
16
19144 Digo plays with Numbers   8 685
9
11
3944 Bee Walk   17 1303
11
15
19686 Mining Camps   2 74
26
26
18965 Milk Scheduling   11 789
11
15
34025 Palindrome Maker   3 60
17
26
34975 Prime Friendly Numbers   7 26
26
23
26649 Repair road   18 710
6
13
19320 Draw Skyline Graph   3 96
27
21
18273 Encode Integer   14 677
8
7
25309 Save Area 11   10 97
5
10
36710 To the Bird-planet   1 23
17
6

#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