PAT 1028. List Sorting (25)

最新推荐文章于 2021-03-09 21:42:47 发布

xuxumoi

最新推荐文章于 2021-03-09 21:42:47 发布

阅读量291

点赞数

分类专栏： ZJU_PAT 文章标签： PAT 1028 SORT

本文链接：https://blog.csdn.net/xsloop/article/details/44257961

版权

ZJU_PAT 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

//1028. List Sorting (25)
//果然cin cout就会超时间啊
//acc
#include <iostream>
#include <string.h>
#include<algorithm>
using namespace std;

int N, C;
typedef struct
{
	char id[7];
	char name[9];
	int score;
}Stu;

typedef struct
{

}StuName;
Stu s[100001];

bool cmp( Stu s1, Stu s2)
{
	if(C == 1)
	{
		return (strcmp(s1.id, s2.id) < 0);
	}

	if( C == 2)
	{
		if(strcmp(s1.name, s2.name) == 0)
			return (strcmp(s1.id, s2.id) < 0);
		return (strcmp (s1.name, s2.name) < 0);
	}

	if( C == 3)
	{
		if( s1.score == s2.score )
			return (strcmp(s1.id, s2.id) < 0);
		return s1.score < s2.score;
	}
}
int main()
{

	cin >> N >> C;
	int i;


	for(i=0;i<N;i++)
	{
		scanf("%s %s %d", &s[i].id, &s[i].name, &s[i].score);
	}
	

	sort( s, s+N, cmp);

	for(i=0;i<N;i++)
	{
		printf("%s %s %d\n",s[i].id,  s[i].name,s[i].score );
	}
	return 0;
}