View Code of Problem 5

#include<stdio.h>

typedef struct {
    int apple;
    int paparl;
    int xuhao;
}fruit;
int main(){
    int t;
    scanf("%d",&t);
    fruit fruit1[100000];
    while (t--){
        int n,m;
        scanf("%d %d",&n,&m);
        for (int i = 0; i < n ; i++) {
            scanf("%d %d",&fruit1[i].apple,&fruit1[i].paparl);
            fruit1[i].xuhao=i+1;
        }
        fruit temp;
        for (int j = 0; j <n ; j++) {
            for (int i = j+1; i <n ; i++) {
                if (fruit1[i].apple>fruit1[j].apple){
                    temp=fruit1[i];
                    fruit1[i]=fruit1[j];
                    fruit1[j]=temp;
                } else if (fruit1[i].apple==fruit1[j].apple&&fruit1[i].paparl>fruit1[j].paparl){
                        temp=fruit1[i];
                        fruit1[i]=fruit1[j];
                        fruit1[j]=temp;
                } else if(fruit1[i].xuhao<fruit1[j].xuhao){
                    temp=fruit1[i];
                    fruit1[i]=fruit1[j];
                    fruit1[j]=temp;
                }

            }
        }
        for (int k = 0; k <m -1; k++) {
            printf("%d ",fruit1[k].xuhao);
        }
        printf("%d\n",fruit1[m-1].xuhao);

    }
    return 0;

}

Double click to view unformatted code.


Back to problem 5