#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
const ll MOD=1e9+7;
using namespace std;
map <ll,bool> x;
map <ll,bool> y;
ll N;
vector <ll> vec1;
vector <ll> vec2;
int main(){
cin>>N;
for(int i=1;i<=N;i++){
ll a,b;
cin>>a>>b;
vec1.push_back(a);
vec2.push_back(b);
}
sort(vec1.begin(),vec1.end());
sort(vec2.begin(),vec2.end());
ll s1=vec1.size();
ll s2=vec2.size();
cout<<vec1[s1/2]<<' '<<vec2[s2/2]<<endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
288 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
300 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
296 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
58 ms |
3108 KB |
Output is correct |
2 |
Correct |
66 ms |
3168 KB |
Output is correct |
3 |
Correct |
65 ms |
3140 KB |
Output is correct |
4 |
Correct |
60 ms |
3140 KB |
Output is correct |
5 |
Correct |
64 ms |
3120 KB |
Output is correct |
6 |
Correct |
72 ms |
3240 KB |
Output is correct |
7 |
Correct |
70 ms |
3232 KB |
Output is correct |
8 |
Correct |
67 ms |
3220 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
292 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
288 KB |
Output is correct |
8 |
Correct |
1 ms |
288 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
204 KB |
Output is correct |
2 |
Correct |
2 ms |
308 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
4 |
Correct |
2 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
304 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
7 |
Correct |
2 ms |
296 KB |
Output is correct |
8 |
Correct |
2 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
98 ms |
4120 KB |
Output is correct |
2 |
Correct |
89 ms |
3924 KB |
Output is correct |
3 |
Correct |
83 ms |
3952 KB |
Output is correct |
4 |
Correct |
88 ms |
3272 KB |
Output is correct |
5 |
Correct |
103 ms |
3908 KB |
Output is correct |
6 |
Correct |
123 ms |
3948 KB |
Output is correct |
7 |
Correct |
99 ms |
3956 KB |
Output is correct |
8 |
Correct |
98 ms |
3888 KB |
Output is correct |