- 题目提供者 FarmerJohn2
- 评测方式 云端评测
- 标签 贪心 USACO 2007
- 难度 省选/NOI-
- 时空限制 1000ms / 128MB
Bessy is going to school and doing well. She has taken N (1 ≤ N ≤ 5000 -- except one case where 1 ≤ N ≤ 50,000) tests and recorded the scores (Ti points out of Pi points for test i; 0 ≤ Ti ≤ Pi < 40,000; 0 < Pi) as this task's input.
Her teacher will drop the D tests with the lowest percentage (Ti⁄Pi) before calculating Bessie's final grade (which is the sum of the remaining test score points over the sum of the remaining total test points). Bessy is good at math and quickly realizes that this does not benefit her as much as it might.
To prove her point, Bessy wants to find all values of D for which she could have ended up with a higher grade by choosing to drop different tests than the teacher would have. Help her by finding and printing all values of D for which this is possible.
Bessy has noted that, amazingly, she has never scored the same percentage on two different tests.
Line 1: A single integer, N
Lines 2..N+1: Line i+1 contains two space-separated integers: Ti and Pi输出格式：
Line 1: A single integer K (0 ≤ K ≤ N) that is the number of values of D for which Bessy could have ended up with a higher grade by dropping a different set of D tests than the teacher.
Lines 2..K+1: The values of D for which this is true, in ascending numerical order.