#include<bits/stdc++.h>
#define REP(i,a,b) for(int i = a; i < b;i++)
#define int long long
using namespace std;
signed main()
{
int n,mx,my; cin >> n;
vector<int> x(n), y(n);
REP(i,0,n)
{
cin >> x[i] >> y[n];
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
if(n %2 == 0)
{
mx = x[n/2];
my = y[n/2];
}
else
{
mx = (x[(n-1)/2] + x[(n+1)/2])/2;
my = (y[(n-1)/2] + y[(n+1)/2])/2;
}
cout << mx<< " " << my;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
64 ms |
1868 KB |
Output is correct |
2 |
Correct |
69 ms |
1848 KB |
Output is correct |
3 |
Incorrect |
62 ms |
1868 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
86 ms |
1844 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |