제출 #481773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481773		sicho_mohit	Best Place (NOI17_bestplace)	C++17	100 / 100	79 ms	1844 KiB

bestplace

#include<bits/stdc++.h>
using namespace std;
#define ff               first
#define ss              second
#define ll             long long
#define pb              push_back
#define pii             pair<int ,int>
#define pll      		pair<long ,long>
#define mii             map<int,int>
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define ull             unsigned long long
#define fastio          ios_base::sync_with_stdio();cin.tie(NULL)
const int mod = 1e9 + 7;
ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}
ll binopow(ll b, ll pow) { if (pow == 0) return 1 ; ll ans; ans = binopow(b, pow / 2); ans = (ans * ans) % mod; if (pow % 2) ans = (ans * b) % mod; return ans; }
ll inv(ll a , ll mod) { return binopow(a, mod - 2); }
//------------------------------------------------------------------------------------------------------------------------------------------//
int main ()
{
	fastio;
	ll n ;
	cin >> n;
	ll x[n];
	ll y[n];
	for (int i = 0; i < n; i++)
	{
		cin >> x[i];
		cin >> y[i];
	}
	sort(x, x + n);
	sort(y, y + n);
	cout << x[n / 2] << " " << y[n / 2] << "\n";
}

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