#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int n; cin >> n;
int x[n],y[n];
for(int i=1;i<=n;++i) cin >> x[i] >> y[i];
sort(x,x+n);
sort(y,y+n);
cout << x[n/2] << " " << y[n/2];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
500 KB |
Output is correct |
3 |
Correct |
1 ms |
604 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
2012 KB |
Output is correct |
2 |
Correct |
18 ms |
1884 KB |
Output is correct |
3 |
Correct |
21 ms |
2652 KB |
Output is correct |
4 |
Correct |
14 ms |
2612 KB |
Output is correct |
5 |
Correct |
18 ms |
2552 KB |
Output is correct |
6 |
Correct |
19 ms |
2652 KB |
Output is correct |
7 |
Incorrect |
19 ms |
2652 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
1 ms |
492 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
1880 KB |
Output is correct |
2 |
Incorrect |
28 ms |
3928 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |