I need to make a greedy algorithm to solve this problem.

I need some help getting started.

https://utah.kattis.com/problems/bank

Make sure to test this input (answer should be 50):

4 4

5 0

25 1

10 2

15 2

Oliver is a manager of a bank near KTH and wants to close soon. There are many people standing in the queue wanting to put cash into their accounts after they heard that the bank increased the interest rates by 42% (from 0.01% per year to 0.0142% per year). However, there are too many people and only one counter is open which can serve one person per minute. Greedy as Oliver is he would like to select some people in the queue so that the total amount of cash stored by these people is as big as possible and that money then can work for the bank overnight. There is a problem, though. Some people don't have the time to wait until the bank closes because they have to run somewhere else, so they have to be served before a certain time, after which they just leave. Oliver also turned off the infrared door sensor outside the bank, s that no more people can enter, because it's already too crowded in the hall. Help Oliver calculate how much cash he can get from the people currently standing in the queue before the bank closes by serving at most one person per minute. Input The first line of input contains two integers N (1 lessthanorequalto N lessthanorequalto 10 000) and T (1 lessthanorequalto T lessthanorequalto 47), the number of people in the queue and the time in minutes until Oliver closes the bank. Then follow N lines, each with 2 integers c_i and t_i, denoting the amount of cash in Swedish crowns person i has and the time in minutes from now after which person i leaves if not served. Note that it takes one minute to serve a person and you must begin serving a person at time t_i at the latest. You can assume that 1 lessthanorequalto c_i lessthanorequalto 100 000 and 0 lessthanorequalto t_i