1187 最小年龄的3个职工

/*建立相应的数据结构就可以解决问题*/# include <stdio.h>struct Employee{int id;char name[20];int age;};void sort(Employee * person, int n){Employee temp;int i,j;for(i = 0; i < n; i++){for(j = 0; j < n-1; j++){if(person[j].age > person[j+1].age){temp = person[j+1];person[j+1] = person[j];person[j] = temp;}}}}int main(void){int n;Employee person[100];while(scanf("%d", &n) != EOF){ getchar();    //吸收回车符。if(n <= 0) break;int i;for(i = 0; i < n; i++){scanf("%d %s %d", &person[i].id, person[i].name, &person[i].age);}sort(person, n);for(i = 0; i < 3; i++){printf("%d %s %d\n", person[i].id, person[i].name, person[i].age);}}return 0;}