제출 #696229

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
696229		igu	Best Place (NOI17_bestplace)	C++17	100 / 100	92 ms	3084 KiB

bestplace

#include<iostream>
#include <bits/stdc++.h>

using namespace std;

double median(int arr[], int size){
   sort(arr, arr+size);
   if (size % 2 != 0)
      return (double)arr[size/2];
   return (double)(arr[(size-1)/2] + arr[size/2])/2.0;
}

int main() {
   int x;
   cin >> x;
   int ans;
   int bns;
   int a;
   int b;
   int arr[x]; 
   int brr[x];
   for (int i = 0; i < x; i++){
      cin >> a >> b;
      arr[i]=a;
      brr[i]=b;
   }
    ans = median(arr,x);
    bns = median(brr,x);
	cout << ans << " " << bns;
	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