编写题解 2919: 奖学金

解题思路:

注意事项:

参考代码:

#include<stdio.h>

struct student {

int id;

int yw, sx, yy;

int sum;

};

struct student a[500];

struct student t;

int main() {

int n, i, j, k;

scanf("%d", &n);

for (i = 0; i < n; i++) {

scanf("%d %d %d", &a[i].yw, &a[i].sx, &a[i].yy);

a[i].sum = a[i].yw + a[i].sx + a[i].yy;

a[i].id = i + 1;

}

for (i = 0; i < n - 1; i++) {

for (k = 0; k < n - i; k++) {

if (a[k].sum < a[k + 1].sum) {

t = a[k];

a[k] = a[k + 1];

a[k + 1] = t;

} else if (a[k].sum == a[k + 1].sum) {

if (a[k + 1].yw > a[k].yw) {

t = a[k];

a[k] = a[k + 1];

a[k + 1] = t;

}

}

}

}

for(i=0;i<5;i++){

printf("%d %d\n",a[i].id,a[i].sum);

}

}