1028 List Sorting

1028 List Sorting

Input Specification:

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

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

struct student
{
  int id;
  char name[10];
  int score;
}stu[100000];

int now;

bool cmp(student s1, student s2)
{
  if (now == 1)
  {
    return s1.id < s2.id;
  }
  if (now == 2)
  {
    if (strcmp(s1.name, s2.name) != 0)
    {
      return strcmp(s1.name, s2.name) < 0;
    }
    else
    {
      return s1.id < s2.id;
    }
  }
  if (now == 3)
  {
    if (s1.score!= s2.score)
    {
      return s1.score < s2.score;
    }
    else
    {
      return s1.id < s2.id;
    }
  }
}

int main()
{
  int n = 0;
  int c = 0;
  scanf_s("%d %d", &n, &c);
  now = c;
  for (int i = 0; i < n; i++)
  {
    scanf_s("%d %s%d", &stu[i].id, &stu[i].name, sizeof(char) * 10, &stu[i].score);
  }
  sort(stu, stu + n, cmp);
  for (int i = 0; i < n; i++)
  {
    printf("%06d %s %d\n", stu[i].id, stu[i].name, stu[i].score);
  }
}