#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const int INF = 1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
for(int i=0; i<n; i++){
cin >> x[i] >> y[i];
}
sort(all(x));
sort(all(y));
int mid = n/2;
int ans_x = x[mid];
int ans_y = y[mid];
cout << ans_x << " " << ans_y;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
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 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
1100 KB |
Output is correct |
2 |
Correct |
20 ms |
1108 KB |
Output is correct |
3 |
Correct |
21 ms |
1112 KB |
Output is correct |
4 |
Correct |
16 ms |
1100 KB |
Output is correct |
5 |
Correct |
21 ms |
1100 KB |
Output is correct |
6 |
Correct |
24 ms |
1112 KB |
Output is correct |
7 |
Correct |
21 ms |
1100 KB |
Output is correct |
8 |
Correct |
21 ms |
1100 KB |
Output is correct |
# |
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 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
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 |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
31 ms |
1100 KB |
Output is correct |
2 |
Correct |
30 ms |
1100 KB |
Output is correct |
3 |
Correct |
24 ms |
1100 KB |
Output is correct |
4 |
Correct |
28 ms |
1100 KB |
Output is correct |
5 |
Correct |
40 ms |
1100 KB |
Output is correct |
6 |
Correct |
30 ms |
1100 KB |
Output is correct |
7 |
Correct |
33 ms |
1100 KB |
Output is correct |
8 |
Correct |
31 ms |
1100 KB |
Output is correct |