Sixteen problems from Codeforces and AtCoder, submitted on those sites. They
follow the week's order: pairs and sorting first (letters and cards to sort,
a guidebook sorted by city and then by score, IDs built from a sorted list),
then comparators and the sort-once-search-many pattern (lower_bound on a
sorted list of prices, drinks, heights or candies), and unique at the end.
The statements are in English (and Japanese, on AtCoder). Read the limits:
Letters' room numbers and Eating Queries' sums need long long, and
Interesting drink and Counting 2 have up to 2·10⁵ queries each — one
sort, then a binary search per query.