排序查找

#include<stdio.h>
int chazhao(int score[],int m,int n)
{
int i;
for(i=0;i<n;i++){
if(score[i]m){
m=i;
return m+1;
}
}
return 0;
}
void paixu(int score[],int n)
{
int i,j,k,temp;
for(i=0;i<n-1;i++){
k=i;
for(j=i+1;j<n;j++){
if(score[j]>score[k]){
k=j;
}
}
if(k!=i){
temp=score[i];
score[i]=score[k];
score[k]=temp;
}
}
}
int main()
{
int n,score[50],m,i,h;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&score[i]);
}
scanf("%d",&m);
paixu(score,n);
for(i=0;i<n;i++)
{
if(((i+1)%100)||i==n-1)
printf("%d\n",score[i]);
else printf("%d “,score[i]);
}
h=chazhao(score,m,n);
if(h!=0){
printf(”%d\n",h);
}else{
printf(“no this score!\n”);
}
return 0;
}