poj 3111 K Best 二分搜索 最大化平均值

K Best

Time Limit: 8000MS		Memory Limit: 65536K
Total Submissions: 7623		Accepted: 1970
Case Time Limit: 2000MS		Special Judge

DescriptionDemy has n jewels. Each of her jewels has some value vi and weight wi.
Since her husband John got broke after recent financial crises, Demy has decided to sell some jewels. She has decided that she would keep k best jewels for herself. She decided to keep such jewels that their specific value is as large as possible. That is, denote the specific value of some set of jewels S = {i1, i2, …, ik} as

.
Demy would like to select such k jewels that their specific value is maximal possible. Help her to do so.
InputThe first line of the input file contains n — the number of jewels Demy got, and k — the number of jewels she would like to keep (1 ≤ k ≤ n ≤ 100 000).
The following n lines contain two integer numbers each — vi and wi (0 ≤ vi ≤ 106, 1 ≤ wi ≤ 106, both the sum of all vi and the sum of all wi do not exceed 107).
OutputOutput k numbers — the numbers of jewels Demy must keep. If there are several solutions, output any one.
Sample InputSample OutputSourceNortheastern Europe 2005, Northern Subregion错因分析：不能写成sigma(v)/sigma(w)<=x分析：挑战上143页，二分搜索，记sigma(v)/sigma(w)>=x,问题转换成了求x得最大值，二分搜索就行