{"problem":{"name":"Choose Me","description":{"content":"AtCoder City will hold a mayoral election. The candidates are Aoki and Takahashi.   The city consists of $N$ towns, the $i$\\-th of which has $A_i$ pro-Aoki voters and $B_i$ pro-Takahashi voters. There","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc187_d"},"statements":[{"statement_type":"Markdown","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?\n\n## Constraints\n\n*   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$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $B_1$\n$\\vdots$\n$A_N$ $B_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc187_d","tags":[],"sample_group":[["4\n2 1\n2 2\n5 1\n1 3","1\n\nAfter making a speech in the third town, Aoki and Takahashi will get $5$ and $6$ votes, respectively."],["5\n2 1\n2 1\n2 1\n2 1\n2 1","3\n\nAfter making speeches in three towns, Aoki and Takahashi will get $4$ and $9$ votes, respectively."],["1\n273 691","1"]],"created_at":"2026-03-03 11:01:14"}}