# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54866 | 2018-07-05T08:27:04 Z | linkret | Printed Circuit Board (CEOI12_circuit) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; #define f first #define s second const int maxn = 1e5 + 10; int n; pii p[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n; for(int i = 0; i < n; i++) { cin >> p[i].f >> p[i].s; } for(int i = 0; i < 20; i++) { if(i & 1) sort(p, p + n); else sort(p, p + n, greater<pii>()) } cout << 0 << endl; return 0; }