| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 875828 | Champ_Naman | Best Place (NOI17_bestplace) | C++14 | 72 ms | 3372 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;
int main(){
int n; cin>>n;
vector<int> x(n); vector<int> y(n);
for(int i=0; i<n; i++){
cin>>x[i];
cin>>y[i];
}
sort(x.begin(), x.end()); sort(y.begin(), y.end());
if(n % 2 == 0){
cout<< x[(n-1)/2]<< " "<< y[(n-1)/2];
}else{
cout<< x[n/2]<< " "<< y[n/2];
}
return 0;
}| # | 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... | ||||
