제출 #526775

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526775		kabika	Best Place (NOI17_bestplace)	C++14	100 / 100	37 ms	4040 KiB

bestplace

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

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  vector<ll> x(n,0), y(n,0);
  for(int i = 0; i<n; i++)
  {
    cin >> x[i] >> y[i];
  }
  sort(x.begin(),x.end());
  sort(y.begin(),y.end());
  if(n%2==0)
  {
    ll xp = (x[n/2] + x[n/2 - 1])/2;
    ll yp = (y[n/2] + y[n/2 - 1])/2;
    cout << xp << " " << yp << '\n';
  }
  else
  {
    ll xp = x[n/2];
    ll yp = y[n/2];
    cout << xp << " " << yp << '\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