제출 #480934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
480934		saarthak	Best Place (NOI17_bestplace)	C++14	100 / 100	46 ms	3792 KiB

bestplace

#include <bits/stdc++.h>
using namespace std;

#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PB push_back
#define RS resize
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define ITR(i, n) for(int i = 0; i < n; i++)
#define M 1000000007

typedef int_fast32_t fint;
typedef int_fast64_t fint64;
typedef vector<fint> vi;
typedef vector<vector<fint>> vvi;
typedef pair<fint, fint> pi;
typedef vector<pair<fint, fint>> vpi;
typedef map<fint, fint> imap;
typedef long long ll;


void solve() {
	fint n;
	cin >> n;
	vi x(n), y(n);
	ITR(i, n)
		cin >> x[i] >> y[i];
	sort(x.B, x.E);
	sort(y.B, y.E);
	cout << x[n/2] << " " << y[n/2] << "\n";
}

int main() {
	io
	
	solve();
	
	return 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