# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425449 | errorgorn | Best Place (NOI17_bestplace) | C++17 | 57 ms | 3252 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 <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n;
vector<int> vx,vy;
int main(){
scanf("%d",&n);
int a,b;
for (int x=0;x<n;x++){
scanf("%d%d",&a,&b);
vx.push_back(a);
vy.push_back(b);
}
sort(vx.begin(),vx.end());
sort(vy.begin(),vy.end());
printf("%d %d\n",vx[n>>1],vy[n>>1]);
}
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... |