12 人解决，24 人已尝试。
26 份提交通过，共有 170 份提交。
6.8 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
Summer again! Flynn is ready for another tour around. Since the tour would take three or more days, it is important to find a hotel that meets for a reasonable price and gets as near as possible!
But there are so many of them! Flynn gets tired to look for any. It’s your time now! Given the
There are some cases. Process to the end of file
Each case begin with N (1 <= N <= 10000), the number of the hotel
The next N line gives the (pi, di) for the i-th hotel.
The number will be a positive and less than 10000.
First, output the number of the hotel you find, and from the next line, print them like the input. You should order them first by price and break the same price by distance.
3 15 10 10 15 8 9
1 8 9
12 人解决，24 人已尝试。
26 份提交通过，共有 170 份提交。
6.8 EMB 奖励。
创建: 15 年，2 月前.
修改: 7 年，2 月前.
最后提交: 1 年，9 月前.
来源: N/A