View Code of Problem 5

#include<stdio.h>
#include<algorithm>
using namespace std;
struct node{
	int apple, pear;
	int id;
}lan[100005];
int cmp(node x,node y)
{
	if (x.apple!=y.apple) return x.apple>y.apple;
	else return x.pear > y.pear;
}
int main()
{
	int t, n, m;
	scanf("%d", &t);
	while (t)
	{
		scanf("%d %d", &n, &m);
		for (int i = 0; i < n; i++)
		{
			scanf("%d %d", &lan[i].apple, &lan[i].pear);
			lan[i].id = i + 1;
		}
		sort(lan, lan + n, cmp);
		for (int i = 0; i < m; i++)
			printf("%d ", lan[i].id);
		t--;
	}
	
}
/*
Main.c:2:20: fatal error: algorithm: No such file or directory
 #include<algorithm>
                    ^
compilation terminated.
*/