Greedy algorithms
Problems on greedy algorithms, including scheduling intervals and deadlines, giving change with coins, choosing items by value per unit, merging with the cheapest cost, covering segments with points, and building the largest or smallest number from digits.
The sorting article in the Basics section and the priority queue article cover the usual tools. Related problem sets are under Sorting, Priority queue and Constructive algorithms.
Problems
Delegation (Platinum)#10605
Very hard
Script#10646
Medium
Schedule#10677
Very hard
Стовпчики#10744
Medium
Spanning Tree#10754
Very hard
Кульки#10759
Hard
Sum of distances#10761
Very easy
Travelling by car - 2#10777
Very hard
Typical ICPC Problem#10827
Very hard
Pebble#10837
Hard
Disk Sort#10883
Very easy