#include<stdio.h>
#include <string.h>
int main()
#define N 10

{  
    int i,j,max,templ;
   char temp2[8];
   char name[10][80];
   int grade[10];
   for( i=0; i<10; i++)
   {
        printf("enter the %d name:\n",i+1);
        gets(name[i]);
        printf("enter the %d grade:\n",i+1);
        scanf("%d", &grade[i]);
        getchar();
   }

   void sort(int grade[],char name[N][8])
   {      
       if( grade[i]<grade[i+1])
      {   
          int i,j,max,templ;
          char temp2[8];
          for(i=0;i<N-i;i++)
          {
              max=i;
              for(j=i;j<N;j++)
                  if(grade[max]<grade[j])
                      max=j;
              templ=grade[i];
              strcpy(temp2,name[i]);
              grade[i]=grade[max];
              strcpy(name[i],name[max]);
              grade[max]=templ;
              strcpy(name[max],temp2);      
          }
          for( i=0; i<10; i++)
          printf("%s,%d\n",name[i],grade[i] );
       }
   }
return 0;
}
其实就是排序不会排。。

void sort(int w[], int n)
{
    if (n <= 1) return;
    int r = n - 1;
    int q = 0;
    for (int i = 0; i < r; ++i) {
        if (w[i] <= w[r]) {
            std::swap(w[i], w[q]);
            ++q;
        }
    }
    std:swap(w[q], w[r]);
    sort(w, q);
    sort(w + q + 1, n - q - 1);
} 

[此贴子已经被作者于2015-11-30 20:55编辑过]

谢谢～