View Code of Problem 5

#include<stdio.h> 
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int i,j,n,m,max; 
		scanf("%d %d",&n,&m);          //n有多少个篮子 m需要多少个 
		int a[n][2];
		for(i=0;i<n;i++)
			scanf("%d %d",&a[i][0],&a[i][1]);       
	    while(m--){
			max=0;
			for(j=0;j<n;j++){
				if(a[max][0]<a[j][0])
				max=j;
				else if(a[max][0]==a[j][0]){
					if(a[max][1]<a[j][1])
					max=j;
				}
			}
			printf("%d",max+1);
			if(m>0)
			printf(" ");
			a[max][0]=-1;
		}
		printf("\n");	
	}
	return 0;
}

Double click to view unformatted code.


Back to problem 5