View Code of Problem 5

# include <stdio.h>
# include <algorithm>
  using namespace std;
  struct node
  {
  	int id,a,b;
  }s[100005];
  int cmp(node x, node y)
  {
  	if(x.a!=y.a)
  	  return x.a>y.a;
  	return x.id<y.id;
  }
  int main()
  {
  	int i,n,m,t;
  	scanf("%d",&t);
  	while(t--)
  	{
	  scanf("%d%d",&n,&m);
	  for(i=0;i<n;i++)
	  {
	  	s[i].id=i+1;
	  	scanf("%d%d",&s[i].a,&s[i].b);
	  }
	  sort(s,s+n,cmp);
	  for(i=0;i<m-1;i++)
	  	printf("%d ",s[i].id);
	printf("%d\n",s[i].id);
	}
	return 0;
  }