这个相对来说比较简单,但是没能一次运行成功。
要记得 结构体存数据取地址
#include<stdio.h>#include<string.h>
#include<stdlib.h>
#pragma warning(disable :4996)
int main()
{
int n;
int i;
int min=101,max=-1;
int minn, maxn ;
struct student {
char name[11];
char id[11];
int chengji;
};
struct student *x;
scanf("%d", &n);
x = (struct student*)malloc(n*sizeof( struct student));
for (i = 0; i < n; i++)
{
scanf("%s %s %d", x[i].name, x[i].id,&x[i].chengji);
}
for (i = 0; i < n; i++)
{
if (x[i].chengji < min)
{
minn = i;
min = x[i].chengji;
}
if (x[i].chengji> max)
{
maxn = i;
max = x[i].chengji;
}
}
printf("%s %d\n", x[maxn].name, x[maxn].chengji);
printf("%s %d\n", x[minn].name, x[minn].chengji);
free(x);
system("pause");
return 0;
}
--------------------------------------------------------------------------------
网上看了一个比较取巧的方法, 他这个相当于只存了两个数据 最大和最小。
#include <stdio.h> #include <string.h> int main() { int n,i; char name[1000][20]; char num[1000][20]; int grade[1000]; int nmax = 0; int cmax = 0; int nmin = 100; int cmin = 0; scanf("%d",&n); for(i = 0;i<n;i++) { scanf("%s %s %d",name[i], num[i], &grade[i]); if(grade[i]>=nmax) { nmax = grade[i]; cmax = i; } if(grade[i]<=nmin) { nmin = grade[i]; cmin = i; } } printf("%s %s\n",name[cmax],num[cmax]); printf("%s %s\n",name[cmin],num[cmin]); }