#include<bits/stdc++.h>
#define REP(i,a,b) for(int i = a; i < b;i++)
typedef long long int ll;
using namespace std;
int main()
{
ll n; cin >> n;
vector<ll> x(n), y(n);
REP(i,0,n)
{
cin >> x[i] >> y[n];
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
cout<<x[n/2]<<" "<<y[n/2];
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 |
57 ms |
1868 KB |
Output is correct |
2 |
Correct |
72 ms |
1868 KB |
Output is correct |
3 |
Correct |
85 ms |
1848 KB |
Output is correct |
4 |
Correct |
55 ms |
1844 KB |
Output is correct |
5 |
Correct |
65 ms |
1844 KB |
Output is correct |
6 |
Correct |
64 ms |
1848 KB |
Output is correct |
7 |
Correct |
59 ms |
1868 KB |
Output is correct |
8 |
Correct |
59 ms |
1848 KB |
Output is correct |
# |
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 |
85 ms |
1868 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |