Submission #976207

#TimeUsernameProblemLanguageResultExecution timeMemory
976207Hercule_PoirotBest Place (NOI17_bestplace)C++17
0 / 100
2 ms856 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n,xx,yy,x[n],y[n];
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>x[i]>>y[i];
	}
	sort(x,x+n);
	sort(y,y+n);
	if(n%2==0){
		xx=(x[(n-2)/2]+x[n/2])/2;
		yy=(y[(n-2)/2]+y[n/2])/2;
	}
	else{
		xx=x[(n-1)/2];
		yy=y[(n-1)/2];
	}
	cout<<xx<<" "<<yy<<"\n";
}
#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...