寒假集训三，EXCEL排序

​​ Excel可以对一组纪录按任意指定列排序。现请你编写程序实现类似功能。 ​​

3 1
000007 James 85
000010 Amy 90
000001 Zoe 60
4 2
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 98
4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 90
0 0

Sample Output

Case 1: 000001 Zoe 60 000007 James 85 000010 Amy 90 Case 2: 000010 Amy 90 000002 James 98 000007 James 85 000001 Zoe 60 Case 3: 000001 Zoe 60 000007 James 85 000002 James 90 000010 Amy 90

代码如下：

#include<iostream>
#include<string.h>
#include<string>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
struct stu
{
    string xuehao;
    string name;
    int grade;
}a[100005];

bool cmp1(stu a,stu b)
{
    
    
    return strcmp(a.xuehao.c_str(),b.xuehao.c_str())<0;
    
}
bool cmp2(stu a,stu b)
{
    if(strcmp(a.name.c_str(),b.name.c_str())!=0)
        return strcmp(a.name.c_str(),b.name.c_str())<0;
    else return strcmp(a.xuehao.c_str(),b.xuehao.c_str())<0;
}
bool
cmp3(stu a,stu b)
{
    if(a.grade!=b.grade)
        return a.grade<b.grade;
    else return strcmp(a.xuehao.c_str(),b.xuehao.c_str())<0;
}
int main()
{
    int cnt=0,i,n,c;
    while(scanf("%d%d",&n,&c)&&n!=0&&c!=0)
    {
        for(i=1;i<=n;i++)
        {
            scanf("%s%s%d",a[i].xuehao.c_str(),a[i].name.c_str(),&a[i].grade);
        }cnt++;
        switch(c)
        {
            case 1:sort(a,a+n+1,cmp1);
                printf("Case %d:\n",cnt);
                for(i=1;i<=n;i++)
                {
                    
                    printf("%s %s %d\n",a[i].xuehao.c_str(),a[i].name.c_str(),a[i].grade);
                    
                }break;
            case 2: sort(a,a+n+1,cmp2);
                printf("Case %d:\n",cnt);
                for(int i=1;i<=n;i++)
                {
                    printf("%s %s %d\n",a[i].xuehao.c_str(),a[i].name.c_str(),a[i].grade);
                    
                }break;
            case 3: sort(a,a+n+1,cmp3);
                printf("Case %d:\n",cnt);
                for(int i=1;i<=n;i++)
                {
                    printf("%s %s %d\n",a[i].xuehao.c_str(),a[i].name.c_str(),a[i].grade);
                    
                }break;
                
        }
    }
    
    return 0;
    
    
}

第二种利用 vector

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

struct student{  //定义结构体 
  string num;
  string name;
  int score;
}temp;

bool cmp1(student a,student b)  //按学号 
{
  return a.num<b.num;
}

bool cmp2(student a,student b)  //按姓名 
{
  if(a.name==b.name)
    return a.num<b.num;
  return a.name<b.name;
}

bool cmp3(student a,student b)  //按成绩 
{
  if(a.score==b.score)
    return a.num<b.num;
  return a.score<b.score;
}


int main()
{
  int n,m,t,cas=1;
  string str;
  while(cin>>n>>m)
  {
    vector<student>vec;  //定义student类型容器 
    vector<student>::iterator it;
    
    if(n==0&&m==0)
      break;
      
    for(int i=1;i<=n;i++)
    {
      cin>>temp.num>>temp.name>>temp.score;
      vec.push_back(temp);
    }
    
    
    if(m==1)
      sort(vec.begin(),vec.end(),cmp1);
    else if(m==2)
      sort(vec.begin(),vec.end(),cmp2);
    else if(m==3)
      sort(vec.begin(),vec.end(),cmp3);
      
    cout<<"Case "<<cas++<<":"<<endl;
    
    for(it=vec.begin();it!=vec.end();it++)
      cout<<it->num<<" "<<it->name<<" "<<it->score<<endl;
  }
  return 0;
}