[SW Expert Academy / D1] 2063 중간값 찾기

#include <iostream>
#include <algorithm>
using namespace std;

int N;
int arr[200];

int main(void){
    cin >> N;
    for(int i = 0 ; i < N ; i++){
        cin >> arr[i];
    }
    
    sort(arr, arr+N);
    cout << arr[N/2];
    
    return 0;
}

 

sort 한방이면 끝!