제출 #531652

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531652		kebine	Best Place (NOI17_bestplace)	C++17	100 / 100	104 ms	2384 KiB

bestplace

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

typedef long long ll;
const ll mod = 1e9 + 7;
#pragma GCC optimize("Ofast")
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define sc second
#define endl '\n'
#define gl ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);



int main()
{
  int n; cin >> n;
  vi x(n), y(n);
  
  for(int i = 0; i < n; i++)
    cin >> x[i] >> y[i];
  
  sort(x.begin(), x.end());
  sort(y.begin(), y.end());
  
  cout << x[n/2] << ' ' << y[n/2] << endl;
}

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