$O(nl\lg n )$
#include<iostream> #include<algorithm> #include<tuple> #include<string> using namespace std; tuple<int, int, int, string> tp[100000]; int n; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> get<3>(tp[i]) >> get<0>(tp[i]) >> get<1>(tp[i]) >> get<2>(tp[i]), get<0>(tp[i]) *= -1, get<2>(tp[i]) *= -1; sort(tp, tp + n); for (int i = 0; i < n; i++) cout << get<3>(tp[i]) + '\n'; return 0; }
댓글 없음 :
댓글 쓰기