# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
486621 | devomega07 | Best Place (NOI17_bestplace) | C++14 | 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 l=long long;
int main()
{
l n; cin >> n;
vector<l> x(n),y(n);
for(int i=0; i<n; ++i) cin >> x[i] >> y[i];
sort(x.begin(),x.end());
sort(y.begin(),y.end());
cout << x[ceil((float)n/2)] << "," << y[ceil((float)n/2] << "\n";
return 0;
}