제출 #503067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
503067		devomega07	Best Place (NOI17_bestplace)	C++14	100 / 100	33 ms	3784 KiB

bestplace

#include "bits/stdc++.h"
#define all(x) x.begin(),x.end()
#define int long long
//#define OSET
using namespace std;

#ifdef OSET
#include "C:\MinGW\lib\gcc\mingw32\6.3.0\include\c++\ext\pb_ds\assoc_container.hpp"
#include "C:\MinGW\lib\gcc\mingw32\6.3.0\include\c++\ext\pb_ds\tree_policy.hpp"
using namespace __gnu_pbds;
template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif

signed main(){
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int n; cin >> n;
	int y[n],x[n]; for(int i=0; i<n; ++i) cin >> x[i] >> y[i];
	sort(x,x+n); sort(y,y+n);
	cout << x[(int)floor((double)n/2)] << ' ' << y[(int)floor((double)n/2)] << '\n';
	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