2 条题解
-
0
#include <stdio.h> #include <stdlib.h> typedef struct { char id[16]; int age; int order; } Patient; int cmp(const void *a, const void *b) { const Patient *x = (const Patient *)a; const Patient *y = (const Patient *)b; int ex = x->age >= 60, ey = y->age >= 60; if (ex != ey) return ey - ex; if (ex && x->age != y->age) return y->age - x->age; return x->order - y->order; } int main(void) { int n; if (scanf("%d", &n) != 1) return 0; Patient p[100]; for (int i = 0; i < n; i++) { scanf("%15s %d", p[i].id, &p[i].age); p[i].order = i; } qsort(p, n, sizeof(Patient), cmp); for (int i = 0; i < n; i++) printf("%s\n", p[i].id); return 0; }
信息
- ID
- 7
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 1
- 标签
- 递交数
- 97
- 已通过
- 25
- 上传者
吉公网安备22010402001496号