Minion Rush

Problem Infinite army of minions are racing on an infinite 2-D plane. Here's how they race: Each minion chooses exactly one x coordinate and races along it in positive y direction, starting from (x, 0). There exists exactly one minion for each x coordinate on that plane and hence there are infinite minions! There are N horizontal barriers lying on this plane. The ith barrier is defined