#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define all(x) x.begin(), x.end()
const char nd = '\n';
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//
ll n;
cin >> n;
vl a(n), b(n);
for (ll i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
sort(all(a));
sort(all(b));
cout << a[n / 2] << " " << b[n / 2] << nd;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
2136 KB |
Output is correct |
2 |
Correct |
19 ms |
2256 KB |
Output is correct |
3 |
Correct |
19 ms |
2252 KB |
Output is correct |
4 |
Correct |
15 ms |
2260 KB |
Output is correct |
5 |
Correct |
18 ms |
2268 KB |
Output is correct |
6 |
Correct |
23 ms |
2260 KB |
Output is correct |
7 |
Correct |
19 ms |
2124 KB |
Output is correct |
8 |
Correct |
20 ms |
2260 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
316 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
352 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
356 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
3028 KB |
Output is correct |
2 |
Correct |
33 ms |
3144 KB |
Output is correct |
3 |
Correct |
20 ms |
3012 KB |
Output is correct |
4 |
Correct |
25 ms |
2260 KB |
Output is correct |
5 |
Correct |
27 ms |
3028 KB |
Output is correct |
6 |
Correct |
28 ms |
3028 KB |
Output is correct |
7 |
Correct |
28 ms |
3048 KB |
Output is correct |
8 |
Correct |
28 ms |
3024 KB |
Output is correct |