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
Water Monopoly#4339
Very hard
For kefir!#4400
Easy
Chinese clock#4427
Medium
Vitaliy and Sequence#4512
Very easy
Sages#4519
Hard
Compacting Stickers#4522
Very easy
Robots in Crimea#4550
Medium
Task about Appointment#4585
Very easy
Evacuation Plan#4586
Very hard
Hexagon#4627
Hard
Hop-skip#4655
Hard
Circular Railway#4666
Very hard
Exam#4682
Hard
Adventure#4699
Very hard
Boxes#4701
Medium
Cafe "Proboscis"#4746
Very easy
Knapsack#4831
Medium
Monopoly#4846
Easy