题解：

#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<algorithm>
using namespace std;

const double eps = 1e-8;
const int maxn = 1e6+5;
int n,k;
int v[maxn],w[maxn];
struct node{
	int id;
	double s;
	bool operator < (const node &a)const {
	return 	s>a.s;
	}
}sum[maxn];
bool ok(double x)
{
	for(int i=0;i<n;i++)
	{
		sum[i].s=v[i]-w[i]*x;
		sum[i].id=i+1;
	}
	sort(sum,sum+n);
	double all=0;
	for(int i=0;i<k;i++)
	{
		all+=sum[i].s;
	}
	return all>=0;
}
void bsearch()
{
	double left=0,right=1e7;
	double mid;
	while(right-left>eps)
	{
		mid=(left+right)/2;
		if(ok(mid))
			left=mid;
		else right=mid;
	}
	for(int i=0;i<k;i++)
	{
		if(i==0)
		cout<<sum[i].id;
		else
		cout<<" "<<sum[i].id;
	}
	cout<<endl;
}
int main()
{
	cin>>n>>k;
	for(int i=0;i<n;i++)
	{
		cin>>v[i]>>w[i];
	}
	bsearch();
	return 0;
}