1028 List Sorting (25 分)

Excel can sort records according to any column. Now you are supposed to imitate this function.

Input Specification:

Each input file contains one test case. For each case, the first line contains two integers N (≤) and C, where N is the number of records and C is the column that you are supposed to sort the records with. Then N lines follow, each contains a record of a student. A student's record consists of his or her distinct ID (a 6-digit number), name (a string with no more than 8 characters without space), and grade (an integer between 0 and 100, inclusive).

Output Specification:

For each test case, output the sorting result in N lines. That is, if C = 1 then the records must be sorted in increasing order according to ID's; if C = 2 then the records must be sorted in non-decreasing order according to names; and if C = 3 then the records must be sorted in non-decreasing order according to grades. If there are several students who have the same name or grade, they must be sorted according to their ID's in increasing order.

Sample Input 1:

3 1
000007 James 85
000010 Amy 90
000001 Zoe 60

Sample Output 1:

000001 Zoe 60
000007 James 85
000010 Amy 90

Sample Input 2:

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

Sample Output 2:

000010 Amy 90
000002 James 98
000007 James 85
000001 Zoe 60

Sample Input 3:

4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 90

Sample Output 3:

000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90
分析：就是排序的一道题 要注意不能使用cin和cout 不然会超时 
用 cin和 cout写法

 #define _CRT_SECURE_NO_WARNINGS
 #include<iostream>
 #include<string>
 #include<stdlib.h>
 #include<vector>
 #include<algorithm>

 using namespace std;
 typedef string s[];
 int N, C;
 bool compare(const vector<string> &s1,const vector<string> &s2)
 {
     return (s1[C - ] != s2[C - ]) ? s1[C - ] < s2[C - ] : s1[] < s2[];
 }
 int main()
 {
     cin >> N >> C;
     vector<vector<string> > T(N);
     s str;
     for (int i = ; i < N; i++)
     {
         cin >> str[] >> str[] >> str[];
         T[i].push_back(str[]);
         T[i].push_back(str[]);
         T[i].push_back(str[]);
     }
     sort(T.begin(), T.end(), compare);
     for (auto it : T)
         cout << it[] <<" "<< it[]<<" "<< it[] << endl;
 }