ID NAME QUALITY USERS ACC % DIFFICULTY C I
19274 Operators   12 462
15
19
36670 Bipartite Permutation   5 48
14
17
36671 Bipartite Permutation (Hard)   2 3
26
34
11515 I AM VERY BUSY   122 5616
8
11
27271 Collecting Coins   89
12
17
34501 Divisible Strings   5 108
15
17
27039 Assembly line   15 383
15
14
348 Expedition   30 1170
17
21
35337 Faketorial Hashing   1 0
34
34
5467 Finding password   5 172
24
34
5117 Wine trading in Gergovia   42 2482
7
11
34275 Game Store   3 110
6
6
26385 Harish and his rooks puzzle   3 141
6
1
132 Help R2-D2!   11 663
22
20
26651 Hydroelectric dams   9 554
16
16
19144 Digo plays with Numbers   8 633
9
11
3944 Bee Walk   17 1253
11
15
19686 Mining Camps   1 69
17
17
18965 Milk Scheduling   11 738
11
15
34025 Palindrome Maker   3 53
17
26
34975 Prime Friendly Numbers   7 22
26
23
26649 Repair road   18 662
6
13
19320 Draw Skyline Graph   3 92
27
21
18273 Encode Integer   14 626
8
7
25309 Save Area 11   9 93
6
12
36710 To the Bird-planet   1 6
1
17

#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