{"raw_statement":[{"iden":"problem statement","content":"AtCoder City will hold a mayoral election. The candidates are Aoki and Takahashi.  \nThe city consists of $N$ towns, the $i$\\-th of which has $A_i$ pro-Aoki voters and $B_i$ pro-Takahashi voters. There are no other voters.  \nTakahashi can make a speech in each town.  \nIf he makes a speech in some town, all voters in that town, pro-Takahashi or pro-Aoki, will vote for Takahashi.  \nOn the other hand, if he does not make a speech in some town, the pro-Aoki voters in that town will vote for Aoki, and the pro-Takahashi voters will not vote.  \nTo get more votes than Aoki, in how many towns does Takahashi need to make speeches at least?"},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\le N \\le 2 \\times 10^5$\n*   $1 \\le A_i, B_i \\le 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $B_1$\n$\\vdots$\n$A_N$ $B_N$"},{"iden":"sample input 1","content":"4\n2 1\n2 2\n5 1\n1 3"},{"iden":"sample output 1","content":"1\n\nAfter making a speech in the third town, Aoki and Takahashi will get $5$ and $6$ votes, respectively."},{"iden":"sample input 2","content":"5\n2 1\n2 1\n2 1\n2 1\n2 1"},{"iden":"sample output 2","content":"3\n\nAfter making speeches in three towns, Aoki and Takahashi will get $4$ and $9$ votes, respectively."},{"iden":"sample input 3","content":"1\n273 691"},{"iden":"sample output 3","content":"1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}