flag30成绩排序列

# include <stdio.h>
# include <malloc.h>
struct node
{
long long id;
int range;
int score;
int locate;
}base[1024];
void sort(struct node* base,int size);
void xianshi(struct node* base,int T);
void range(struct node* base,int T);
int main()
{
int T1=5,T2=4;
base[0].id=001;
base[0].score=95;
base[1].id=005;
base[1].score=100;
base[2].id=003;
base[2].score=95;
base[3].id=002;
base[3].score=77;
base[4].id=004;
base[4].score=85;
base[5].id=013;
base[5].score=65;
base[6].id=011;
base[6].score=25;
base[7].id=14;
base[7].score=100;
base[8].id=012;
base[8].score=85;
sort(base,T1+T2);
range(base,T1+T2);
xianshi(base,T1+T2);
return 0;
}
void sort(struct node* base,int size)
{
struct node tmp;
bool change=true;
for(int i=0;i<size && change;i++)
{
change=false;
for(int j=size-1;j>i;j--)
{
if(base[j].score>base[j-1].score)
{
tmp=base[j];
base[j]=base[j-1];
base[j-1]=tmp;
change=true;
}
}
}
}
void xianshi(struct node* base,int T)
{
for(int i=0;i<T;i++)
printf ("%0 12lld  %d   %d\n",base[i].id,base[i].score,base[i].range);
}
void range(struct node* base,int T)
{
struct node tmp;
base[0].range=1;
for(int i=1;i<T;i++)
{
if(base[i].score==base[i-1].score)
{
base[i].range=base[i-1].range;
if(base[i].id<base[i-1].id)
{
tmp=base[i];
base[i]=base[i-1];
base[i-1]=tmp;
}
}
else
base[i].range=i;

}
}