Hello, Codeforces community!

I want to invite you guys to another Code Monk contest which is later today. The contest is based on Heaps, and its basic usage.

The link to the tutorial: https://www.hackerearth.com/practice/data-structures/trees/heapspriority-queues/tutorial/

The link to the contest: https://www.hackerearth.com/challenge/competitive/code-monk-heaps-and-priority-queues-1/

belowthebelt, prat33k, r3gz3n, MazzForces and trytolearn have contributed towards the making of the contest, creating problems, testing them and writing editorials and with the general feedback and management of the contest. They've worked extremely hard on making this contest a unique learning experience for people who want to learn the concepts of heaps and understand its working and structure.

The problem set consists of 5 algorithmic tasks with partial solutions allowed — you get points for every test that your solution passes. Also, top 3 newbie winners to get HackerEarth T-shirts in each Code Monk challenge!

Good luck to everyone, and have fun! :)