题解 | 大整数排序

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool cmp(string s1, string s2) {
	if (s1.length() != s2.length())
		return s1.length() < s2.length();
	else {
		int i = 0;
		for (i = 0; i < s1.length(); i++) {
			if (s1[i] != s2[i])
				break;
		}
		return s1[i] < s2[i];
	}

	
}
int main() {
	int n;
	cin >> n;
	vector<string> v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end(),cmp);
	for (int i = 0; i < n; i++) {
		cout << v[i] << endl;
	}
}