Submission #949182

#TimeUsernameProblemLanguageResultExecution timeMemory
949182vjudge1Best Place (NOI17_bestplace)C++17
100 / 100
69 ms1364 KiB
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
const int INF=1e9,N=2e5+5;
void solve(){
	int n;cin>>n;
	vector<int> x(n),y(n);
	for(int i=0;i<n;i++){
		cin>>x[i]>>y[i];
	}
	sort(all(x)); sort(all(y));
	cout<<x[n/2]<<' '<<y[n/2]<<endl;
}
int main(){
	solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...