我的最清晰👀️ 😄

#include <stdio.h>

#include <string.h>

typedef struct Student{

char name[100];

int qichen;

int banchen;

char xue;

char xi;

int fa;

}S;

int main()

{

int dx=0;

int n;

scanf("%d",&n);

while(n--){

int x;

scanf("%d",&x);

S stu[x];

int sum=0;

int ar[x];

for(int i=0;i<x;i++){

ar[i]=0;

scanf("%s %d %d %c %c%d",stu[i].name,&stu[i].qichen,&stu[i].banchen,&stu[i].xue,&stu[i].xi,&stu[i].fa);

if(stu[i].qichen>80&&stu[i].fa>=1){

sum+=8000;

ar[i]+=8000;

} if(stu[i].qichen>85&&stu[i].banchen>80){

sum+=4000;

ar[i]+=4000;

}

if(stu[i].qichen>90){

sum+=2000;

ar[i]+=2000;

}

if(stu[i].qichen>85&&stu[i].xi=='Y'){

sum+=1000;

ar[i]+=1000;

}

if(stu[i].banchen>80&&stu[i].xue=='Y'){

sum+=850;

ar[i]+=850;

}

}

int ak47=0;

for(int k=0;k<x;k++){

if(ar[k]>ak47){

ak47=ar[k];

dx=k;

}

}

printf("%s\n",stu[dx].name);

printf("%d\n",ak47);

printf("%d\n",sum);

} return 0;

}

#include <stdio.h>

#include <string.h>

typedef struct jiangxuejin {

char a[101];

int average;

int pingyi;

char b;

char c;

int fabiao;

} S;

int main() {

int N;

scanf("%d", &N);

while (N--) {

int n;

scanf("%d", &n);

S stu[n];

int jxj[n];

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

jxj[i] = 0;

scanf("%s %d %d", stu[i].a, &stu[i].average, &stu[i].pingyi);

getchar();

scanf("%c", &stu[i].b);

getchar();

scanf("%c", &stu[i].c);

getchar();

scanf("%d", &stu[i].fabiao);

if (stu[i].average > 90) {

jxj[i] += 2000;

}

if (stu[i].average > 80 && stu[i].fabiao >= 1) { jxj[i] += 8000; } if (stu[i].average > 85 && stu[i].pingyi > 80) {

jxj[i] += 4000;

}

if (stu[i].average > 85 && stu[i].c == 'Y') {

jxj[i] += 1000;

}

if (stu[i].pingyi > 80 && stu[i].b == 'Y') {

jxj[i] += 850;

}

}

int max = jxj[0], index = 0, sum = jxj[0];

for (int i = 1; i < n; i++) {

sum += jxj[i];

if (max < jxj[i]) {

max = jxj[i];

index = i;

}

}

printf("%s\n%d\n%d\n", stu[index].a,

jxj[index], sum);

}

return 0;

}

#include<stdio.h>
struct node
{
	char name[1000];
	int a,b;//期末成绩 班成绩 
	char x[10],y[10];//干部 省 
	int num;//论文 
}; 

int main()
{
	int n;
	scanf("%d",&n);
	struct node arr[100];
	while(n--){
		int x;
		scanf("%d",&x);
		int sum[10000]={0};
		int all=0;
		int flag1=0;
		int num1=0;
		for(int i=0;i<x;i++){
			scanf("%s %d %d %s %s %d",arr[i].name,&arr[i].a,&arr[i].b,arr[i].x,arr[i].y,&arr[i].num);
			if(arr[i].a>80&&arr[i].num>0){
				sum[i]+=8000;
			}
			if(arr[i].a>85&&arr[i].b>80){
				sum[i]+=4000;
			}
			if(arr[i].a>90){
				sum[i]+=2000;
			}
			if(arr[i].a>85&&arr[i].y[0]=='Y'){
				sum[i]+=1000;
			}
			if(arr[i].b>80&&arr[i].x[0]=='Y'){
				sum[i]+=850;
			}
			all+=sum[i];
		
			if(flag1<sum[i]){
				flag1=sum[i];
				num1=i;
			}
			if(i==(x-1)){
				printf("%s\n",arr[num1].name);
				printf("%d\n",flag1);
				printf("%d\n",all);
			}
		}
	
	}
	return 0;
}