题解 | #两种排序方法#

#include <iostream>
#include <vector>
#include <string>

using namespace std;

int main() {
	int n;
	cin >> n;
	vector<string> arr;
	arr.resize(n);
	for (auto& str : arr) {
		cin >> str;
	}
	bool lensort = true, lexsort = true;

	for (size_t i = 1; i < arr.size(); i++) {
		if (arr[i - 1].size() >= arr[i].size()) {
			lensort = false;
			break;
		}
	}

	for (size_t i = 1; i < arr.size(); i++) {
		if (arr[i - 1] >= arr[i]) {
			lexsort = false;
			break;
		}
	}

	if (lensort && lexsort) cout << "both" << endl;
	else if (!lensort && lexsort) cout << "lexicographically" << endl;
	else if (lensort && !lexsort) cout << "lengths" << endl;
	else if (!lensort && !lexsort) cout << "none" << endl;
	return 0;

}