Solution can be in Java or C++

If code isn't an option, a highly detailed explanation for how to implement it is also an option

Bessie is a hungry cow. Each day, for dinner, if there is a haybale in the barn, she will eat one haybale. Farmer John does not want Bessie to starve, so some days he sends a delivery of haybales, which arrive in the morning (before dinner). In particular, on day di, Farmer John sends a delivery of bi haybales (1di1014,1bi109). Compute the total number of haybales Bessie will eat during the first T days. INPUT FORMAT (input arrives from the terminal / stdin): The first line contains N and T(1N105,1T1014). The next N lines each contain di and bi. It is additionally guaranteed that 1d1