#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> x(n+1),y(n+1);
for(int i=1;i<=n;i++){
cin>>x[i]>>y[i];
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
if(n%2==0){
cout<<(x[n/2]+x[n/2+1])/2<<' ';
}else cout<<(x[n/2+1])<<' ';
if(n%2==0){
cout<<(y[n/2]+y[n/2+1])/2;
}else cout<<(y[n/2+1]);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
1116 KB |
Output is correct |
2 |
Correct |
46 ms |
1204 KB |
Output is correct |
3 |
Correct |
45 ms |
1116 KB |
Output is correct |
4 |
Correct |
41 ms |
1116 KB |
Output is correct |
5 |
Correct |
44 ms |
1112 KB |
Output is correct |
6 |
Correct |
45 ms |
1116 KB |
Output is correct |
7 |
Correct |
48 ms |
1404 KB |
Output is correct |
8 |
Correct |
46 ms |
1116 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
1116 KB |
Output is correct |
2 |
Correct |
67 ms |
1112 KB |
Output is correct |
3 |
Correct |
67 ms |
1208 KB |
Output is correct |
4 |
Correct |
52 ms |
1116 KB |
Output is correct |
5 |
Correct |
66 ms |
1112 KB |
Output is correct |
6 |
Correct |
66 ms |
1208 KB |
Output is correct |
7 |
Correct |
67 ms |
1208 KB |
Output is correct |
8 |
Correct |
66 ms |
1116 KB |
Output is correct |