【基础算法】排序sort函数

生日题目描述

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
int const MAXN = 105;

struct schoolmate {
	string s;
	int  y, m, d, id;
}sc[MAXN];

int cmp(schoolmate a, schoolmate b) {
	if(a.y != b.y) return a.y < b.y;
	if(a.m != b.m) return a.m < b.m;
	if(a.d != b.d) return a.d < b.d;
	return a.id > b.id;
}
int main() {
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> sc[i].s >> sc[i].y >> sc[i].m >> sc[i].d;
		sc[i].id = i;
	}
	sort(sc+1, sc+n+1, cmp);
	for(int i = 1; i <= n; i++) cout << sc[i].s << endl;
    return 0;
}

拼数题目描述

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
int const MAXN = 25;

int cmp(string a, string b) {
	return a + b > b + a;
}
int main() {
	int n;
	string s[MAXN];
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> s[i];
	sort(s+1, s+n+1, cmp);
	for(int i = 1; i <= n; i++) cout << s[i];
    return 0;
}