void?sort(int?a[],int?n);
void?failingGrade(int?a[],int?n);
void?max_and_min(int?a[],int?n);
int?main()
{
int?score[10],tmp;
int?i,n;
i=n=0;
while(1)
{
scanf("%d",&tmp);
if(tmp<0)
break;
else?if(tmp>100)
continue;
else
{
score[i]=tmp;
i++;
n++;
}
}
if(n>10)
n=10;
sort(score,n);
for(i=0;i<n;i++)
printf("%d?",score[i]);
printf("\n");
failingGrade(score,n);
max_and_min(score,n);
return?0;
}
//按成績從高到低排序
void?sort(int?a[],int?n)
{
int?i,j;?//j表示趟數,i表示每i趟兩兩比較的次數
int?tmp;?//臨時變量
for(j=0;j<n-1;j++)
for(i=0;i<n-1-j;i++)
{
if(a[i]?<?a[i+1])
{
tmp=a[i];
a[i]=a[i+1];
a[i+1]=tmp;
}
}
}
void?failingGrade(int?a[],int?n)
{
int?i,count;
for(i=0,count=0;i<n;i++)
{
if(a[i]<60)
{
count++;
printf("%d?",a[i]);
}
}
printf("%d\n",count);
}
void?max_and_min(int?a[],int?n)
{
int?max,min,i;
max=min=a[0];
for(i=1;i<n;i++)
{
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
printf("%d?%d\n",max,min);
}