ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   14 528
14
19
36670 Bipartite Permutation   10 207
6
16
36671 Bipartite Permutation (Hard)   5 51
29
31
11515 I AM VERY BUSY   138 6895
9
11
27271 Collecting Coins   2 102
11
21
34501 Divisible Strings   5 176
15
17
27039 Assembly line   16 411
16
14
348 Expedition   46 1543
19
20
35337 Faketorial Hashing   1 0
34
34
5467 Finding password   5 176
24
34
5117 Wine trading in Gergovia   52 2963
7
13
34275 Game Store   6 167
5
7
26385 Harish and his rooks puzzle   5 181
4
1
132 Help R2-D2!   12 721
22
18
26651 Hydroelectric dams   9 675
16
16
19144 Digo plays with Numbers   8 691
9
11
3944 Bee Walk   17 1342
11
15
19686 Mining Camps   2 75
26
26
18965 Milk Scheduling   11 803
11
15
34025 Palindrome Maker   3 65
17
26
34975 Prime Friendly Numbers   7 28
26
23
26649 Repair road   18 719
6
13
19320 Draw Skyline Graph   3 100
27
21
18273 Encode Integer   14 687
8
7
25309 Save Area 11   10 104
5
10
36710 To the Bird-planet   1 24
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