ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   15 539
13
20
36670 Bipartite Permutation   10 299
6
16
36671 Bipartite Permutation (Hard)   5 51
29
31
11515 I AM VERY BUSY   145 7282
9
11
27271 Collecting Coins   2 104
11
21
34501 Divisible Strings   5 183
15
17
27039 Assembly line   17 424
17
14
348 Expedition   52 1752
19
20
35337 Faketorial Hashing   1 0
34
34
5467 Finding password   6 174
26
34
5117 Wine trading in Gergovia   63 3837
8
12
34275 Game Store   6 172
5
7
26385 Harish and his rooks puzzle   5 183
4
1
132 Help R2-D2!   12 723
22
18
26651 Hydroelectric dams   9 689
16
16
19144 Digo plays with Numbers   8 692
9
11
3944 Bee Walk   17 1383
11
15
19686 Mining Camps   2 70
26
26
18965 Milk Scheduling   13 843
10
15
34025 Palindrome Maker   3 64
17
26
34975 Prime Friendly Numbers   7 29
26
23
26649 Repair road   18 735
6
13
19320 Draw Skyline Graph   3 96
27
21
18273 Encode Integer   14 694
8
7
25309 Save Area 11   10 107
5
9
36710 To the Bird-planet   1 25
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