1028. List Sorting (25)

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

Input

Each input file contains one test case. For each case, the first line contains two integers N (<=100000) 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

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.

3 1
000007 James 85
000010 Amy 90
000001 Zoe 60

000001 Zoe 60
000007 James 85
000010 Amy 90

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

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

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

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

#pragma warning(disable:4996)
#include <stdio.h>
#include <iostream>
#include <string>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;
struct Student {
	char  id[8];
	char name[10];
	int grade;
};
vector<Student> s;
bool cmp1(Student a, Student b) {
	if (strcmp(a.id, b.id)<0) return true;
	return false;
}
bool cmp2(Student a, Student b) {
	if (strcmp(a.name, b.name) == 0) {
		if (strcmp(a.id, b.id)<0) return true;
		return false;
	}
	if (strcmp(a.name, b.name)<0) return true;
	return false;
}
bool cmp3(Student a, Student b) {
	if (a.grade == b.grade) {
		if (strcmp(a.id, b.id)<0) return true;
		return false;
	}
	return a.grade<b.grade;
}
int main(void) {
	int n, c;
	cin >> n >> c;
	s.clear();
	for (int i = 0; i < n; i++) {
		Student buf;
		scanf("%s %s %d", buf.id, buf.name, &buf.grade);
	//	cin >> buf.id >> buf.name >> buf.grade;
		s.push_back(buf);
	}
	if (c == 1)
		sort(s.begin(), s.end(), cmp1);
	else if(c==2)
		sort(s.begin(), s.end(), cmp2);
	else if(c==3)
		sort(s.begin(), s.end(), cmp3);
	for (int i = 0; i < n; i++) {
		//cout << s[i].id <<" "<< s[i].name << " " << s[i].grade << endl;
		printf("%s %s %d\n", s[i].id, s[i].name, s[i].grade);
	}
	return 0;
}