제출 #828575

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
828575		NK_	Best Place (NOI17_bestplace)	C++17	100 / 100	32 ms	3084 KiB

bestplace

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using vi = V<int>;
using ll = long long;
using pi = pair<int, int>;
using vpi = V<pi>;
using vl = V<ll>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
 	
	int N; cin >> N;
	vi X(N), Y(N);
	for(int i = 0; i < N; i++) cin >> X[i] >> Y[i];

	sort(begin(X), end(X));
	sort(begin(Y), end(Y));

	cout << X[N / 2] << " " << Y[N / 2] << endl;

	exit(0-0);
}					

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 28 / 28
• Subtask 4: 13 / 13
• Subtask 5: 17 / 17
• Subtask 6: 19 / 19