解题思路:
注意事项:
参考代码:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define maxsize 100000
typedef struct
{
char id[19];
char age[9];
}people;
int compare(const void* a, const void* b)
{
people* A = (people*)a;
people* B = (people*)b;
if (strcmp(A->age, B->age) != 0)
return strcmp(B->age, A->age);
else
return strcmp(B->id, A->id);
}
int main()
{
int i, n,j;
scanf("%d", &n);
people *x;
x = (people*)malloc(sizeof(people) * n);
if (x == NULL)
return 0;
for (i = 0; i < n; i++)
scanf("%s",x[i].id);
for (i = 0; i < n; i++)
{
for (j = 0; j <=7;j++)
{
x[i].age[j] = x[i].id[j + 6];
}
x[i].age[j] = '\0';
}
qsort(x, n, sizeof(people), compare);
for (i = 0; i < n; i++)
printf("%s\n", x[i].id);
return 0;
}
0.0分
1 人评分
C语言程序设计教程(第三版)课后习题3.7 (C语言代码)浏览:328 |
2^k进制数 (C语言描述,蓝桥杯)浏览:1420 |
C语言程序设计教程(第三版)课后习题7.5 (C语言代码)浏览:686 |
简单的a+b (C语言代码)浏览:416 |
神奇的fans (C语言代码)浏览:990 |
简单的a+b (C语言代码)浏览:505 |
1073题解浏览:624 |
C语言程序设计教程(第三版)课后习题6.5 (C语言代码)浏览:702 |
DNA (Java代码)浏览:936 |
A+B for Input-Output Practice (C语言代码)浏览:472 |