$O(nl\lg n)$
#include<iostream> #include<string> #include<algorithm> using namespace std; int n; string s[20000]; bool cmp(string i, string j) { return i.length() < j.length() || i.length() == j.length() && i < j; } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> s[i]; sort(s, s + n, cmp); n = unique(s, s + n) - s; for (int i = 0; i < n; i++) cout << s[i] << endl; return 0; }
댓글 없음 :
댓글 쓰기