#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll N;
cin>>N;
ll x[N], y[N];
for(ll i=0; i<N; i++)
{
ll a, b;
cin>>a >>b;
x[i]=a;
y[i]=b;
}
sort(x, x+N);
sort(y, y+N);
if(N%2!=0)
{
cout<<x[N/2] <<" " <<y[N/2];
}
else
{
ll mid=N/2;
ll miid=(N/2)-1;
cout<<(x[mid]+x[miid])/2 <<" " <<(y[mid]+y[miid])/2;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
300 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 |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
50 ms |
2916 KB |
Output is correct |
2 |
Correct |
57 ms |
2976 KB |
Output is correct |
3 |
Correct |
72 ms |
2992 KB |
Output is correct |
4 |
Correct |
53 ms |
2988 KB |
Output is correct |
5 |
Correct |
55 ms |
2992 KB |
Output is correct |
6 |
Correct |
60 ms |
2896 KB |
Output is correct |
7 |
Correct |
56 ms |
2892 KB |
Output is correct |
8 |
Correct |
61 ms |
3100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
308 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
304 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 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 |
212 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
316 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 |
82 ms |
3756 KB |
Output is correct |
2 |
Correct |
83 ms |
3776 KB |
Output is correct |
3 |
Correct |
74 ms |
3748 KB |
Output is correct |
4 |
Correct |
63 ms |
3064 KB |
Output is correct |
5 |
Correct |
94 ms |
3756 KB |
Output is correct |
6 |
Correct |
88 ms |
3760 KB |
Output is correct |
7 |
Correct |
83 ms |
3748 KB |
Output is correct |
8 |
Correct |
87 ms |
3780 KB |
Output is correct |