# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006045 | kebine | Best Place (NOI17_bestplace) | C++17 | 84 ms | 2320 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;
#define int long long
signed main(){
int n, ansx, ansy;
cin >> n;
vector <int> x, y;
for(int i = 0; i < n; i++){
int xp, yp;
cin >> xp >> yp;
x.push_back(xp);
y.push_back(yp);
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
if(n%2 == 1){
cout << x[(n/2)] << " " << y[(n/2)];
}
else{
cout << (x[(n/2) - 1] + x[n/2])/2 << " " << (y[(n/2) - 1] + y[n/2])/2;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |