九度oj1346

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>

struct customer
{
	int id;
	int sum;
}
a[1002];

int cmp(const void *a,const void *b)
{
	struct customer *s1;
	struct customer *s2;

	s1 = (struct customer *)a;
	s2 = (struct customer *)b;

	if(s1->sum == s2->sum)
		return s1->id-s2->id;
	else
		return s2->sum-s1->sum;
}

int min(int m,int n)
{
	return m < n ? m : n;
}

int main()
{
	int n,m;
	int i;
	while(scanf("%d %d",&n,&m) != EOF)
	{
		for(i=0;i<n;i++)
			scanf("%d %d",&a[i].id,&a[i].sum);

			qsort(a,n,sizeof(struct customer),cmp);

		for(i=0;i<min(m,n);i++)
			printf("%d\n",a[i].id);
	}

	return 0;
}