#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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
248 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
356 KB |
Output isn't correct |
3 |
Incorrect |
4 ms |
432 KB |
Output isn't correct |
4 |
Incorrect |
4 ms |
468 KB |
Output isn't correct |
5 |
Incorrect |
9 ms |
596 KB |
Output isn't correct |
6 |
Incorrect |
9 ms |
596 KB |
Output isn't correct |
7 |
Incorrect |
23 ms |
672 KB |
Output isn't correct |
8 |
Incorrect |
8 ms |
672 KB |
Output isn't correct |
9 |
Incorrect |
6 ms |
672 KB |
Output isn't correct |
10 |
Incorrect |
8 ms |
748 KB |
Output isn't correct |
11 |
Incorrect |
9 ms |
748 KB |
Output isn't correct |
12 |
Incorrect |
14 ms |
748 KB |
Output isn't correct |
13 |
Incorrect |
25 ms |
748 KB |
Output isn't correct |
14 |
Incorrect |
25 ms |
876 KB |
Output isn't correct |
15 |
Incorrect |
28 ms |
1004 KB |
Output isn't correct |
16 |
Incorrect |
64 ms |
1492 KB |
Output isn't correct |
17 |
Incorrect |
99 ms |
1492 KB |
Output isn't correct |
18 |
Runtime error |
27 ms |
2284 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
19 |
Runtime error |
27 ms |
2308 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
20 |
Incorrect |
71 ms |
2320 KB |
Output isn't correct |