# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531672 | kebine | Best Place (NOI17_bestplace) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(){
int n; cin >> n;
vector<ll>x, y;
for(int i = 0; i < n; i++){
ll a, b; cin >> a >> b;
x.push_back(a); y.push_back(b);
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
ll sX = x.size();
ll sY = y.size();
int X = x[sX/2];
int Y = y[sY/2];
cout << X << " " << Y << "
";
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int tc;
tc = 1;
while(tc--){
solve();
}
return 0;
}