X and Y were in an election battle in their city. This city consists of N towns, and each town has M1 number of people who will vote for Y and M2 number of people who will not take part in the election. X after seeing the lack of his supporters, decided to campaign.\n\nIf X does a campaign in town T, both M1 and M2 number of people in this town become his supporters.\n\nYour task is to calculate the least number of towns in which X has to campaign to win the election.\n\nNote: It is always possible for X to win the election.\n\nConstraints:\n 1 < N<= 200000\n 1< M1,M2 <= 1000000000\n\nTest Case\n2\n2 2\n2 2\nAnswer: 1 \nExplanation: X can campaign in either city and gain 4 votes, Y can thus only get a maximum of 2 votes\n\nTest Case #2:\n4\n2 2\n1 3\n5 1\n2 2\nAnswer: 1\nExplanation: X needs to campaign in city 3 to gain 5 + 1 = 6 votes. Y can only get a maximum of 2 + 2 + 1 = 5 votes.\n\nI tried an O(NlogN) solution using priority queue, but it failed a few test cases. Is an O(N) solution possible?

X and Y were in an election battle in their city. This city consists of N towns, and each town has M1 number of people who will vote for Y and M2 number of peop