| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 280232 | Pbezz | Best Place (NOI17_bestplace) | C++14 | 81 ms | 4176 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 loop(i,n) for (ll i = 0; i < n; i++)
#define ll long long
#define INF 100005
#define MOD 1000000007
#define pb push_back
#define mp make_pair
typedef pair<ll,ll> pii;
const ll MAXN=1e6;
ll a[MAXN+1];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n,i,x,y;
vector<ll>xx,yy;
cin>>n;
for(i=0;i<n;i++){
cin>>x>>y;
xx.pb(x);
yy.pb(y);
}
sort(xx.begin(),xx.end());
sort(yy.begin(),yy.end());
cout<<xx[n/2]<<" "<<yy[n/2]<<endl;
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... | ||||
