List Sorting (25)​​​​​​​

List Sorting (25)

时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)

题目描述

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

 

输入描述:

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).


 

输出描述:

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
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;

struct student{
	char name[10];
	int id;
	int grade;
}s[100005];

bool cmp1(struct student x,struct student y)
{
	return x.id<y.id;
}

bool cmp2(struct student x,struct student y)
{
	if(strcmp(x.name,y.name)!=0)
	   return strcmp(x.name,y.name)<0;
	else
	  return x.id<y.id;
}

bool cmp3(struct student x,struct student y)
{
	if(x.grade!=y.grade)
	  return x.grade<y.grade;
	else
	   return x.id<y.id;
}

int main()
{
	int m,n,i,j;
	scanf("%d%d",&n,&m);
    for(i=0;i<n;i++)
	  cin>>s[i].id>>s[i].name>>s[i].grade;
	if(m==1)
	   sort(s,s+n,cmp1);
	else if(m==2)
	  sort(s,s+n,cmp2);
	else
	  sort(s,s+n,cmp3);
	for(i=0;i<n;i++)
	   printf("%06d %s %d\n",s[i].id,s[i].name,s[i].grade);
	 
	return 0;
}

非常简单的一道题,就是审题的时候不认真,结构体比较的时候容易出错,还有就是id不能用字符串表示,要用int 型,最后输出的时候控制一下就好。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值