제출 #1011515

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1011515		christinelynn	Best Place (NOI17_bestplace)	C++17	3 / 100	26 ms	3280 KiB

bestplace

//made by djsksbrbf
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  
  ll n; cin >> n;
  vector <int> xs, ys;
  for(ll i = 0 ; i < n ; i++){
    ll x, y; cin >> x >> y;
    xs.push_back(x);
    ys.push_back(y);
  }
  sort(xs.begin(), xs.end());
  sort(ys.begin(), ys.end());
  
  if(n % 2)cout << (xs[n / 2] + xs[n / 2 - 1]) / 2 << ' ' << (ys[n / 2] + ys[n / 2 - 1] / 2) << endl;
  else cout << xs[n / 2] << ' ' << ys[n / 2] << endl;
  
  return 0;
}

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