#include<stdio.h>
int main()
{int s[10],a[10][10],b[10],c[10];
int i,j,n,t;
s[0]=0;
scanf("%d",&n);
for(i=0;i<n;++i)
{s[i]=0;
for(j=0;j<n;++j)
{scanf("%d",&a[i][j]);
s[i]+=a[i][j];
b[i]=s[i];
}
}
for(i=0;i<n;++i)
for(j=0;j<n-1-i;++j)
{if(s[j]>s[j+1])
{t=s[j];s[j]=s[j+1];s[j+1]=t;
}
}
for(i=0;i<n;++i)
for(j=0;j<n;++j)

{if(s[i]==b[j])
c[i]=j;
}
for(i=0;i<n;++i)
printf("%d ",c[i]+1);
printf("\n");
return 0;
 }

用链表做居然那么长啊

你这个还是没什么变化啊，我说的细节问题是当出现总成绩一样的时候先输出小的学号

#include<stdio.h>
#include<stdlib.h>
 
 struct student{
 int num;
 int score;
 struct student* next;
 } ;
 int n;
 int count=0,a,b,c,d,e;
 scanf("%d",&n);
 struct student* creat{
 
 struct *phead=NULL;
 struct *p1,*p2;
 }
 p2=p1=(struct student*)malloc(sizeof(struct student));
 scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
     p1->num=count;
     pi->score=a+b+c+d+e;
 while(count<n)
 {
     count++;
     if(count==1)
     {p1->next=phead;
     p2=p1;
     phead=p1;
         
     }
     else
     {
         p1->next=NULL;
         p2->next=p1;
         p2=p1;
     }
     p1=(struct student*)malloc(sizeof(struct student));
     scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
     p1->num=count+1;
     pi->score=a+b+c+d+e;
 
 }
 
 free(p1);
 return pheaad;
 }
 void print(struct student* pHead)
 {
     
 }我想要做的是这种的，现在基本理解了格式但是还不能把算法添加进去