solved.ac (feat. 백준, 18110번)

solved.ac
https://www.acmicpc.net/problem/18110

18110번: solved.ac

 

// woohyeon.kim
// kim519620.tistory.com
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
vector<int> arr;
int main() {
	ios::sync_with_stdio(false), cin.tie(NULL);
    register int N, ans = 0, cnt;
    cin >> N;
    if(N == 0)
        cout << ans;
    else{
        for(register int n = 0, v; n < N; ++n)
            cin >> v, arr.push_back(v);
        cnt = static_cast<int>(round(N * 0.15));
        sort(arr.begin(), arr.end());
        for(register int i = cnt; i < N - cnt; ++i)
            ans += arr[i];
        cout << static_cast<int>(round(ans / (N - 2.0 * cnt)));
    }
	return 0;
}
// *&)*@*

 

반응형

정렬을 통해 연산하는 문제입니다.