BOJ 24755 - Election Paradox [C++]

문제

링크

풀이

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
  vector<int> p(n);
  for (int i=0; i<n; i++) cin >> p[i];
  sort(p.begin(), p.end());
 
  int ans = 0;
  for (int i=0; i<(n+1)/2; i++) {
    ans += (p[i] - 1) / 2;
  }
  for (int i=(n+1)/2; i<n; i++) {
    ans += p[i];
  }
  cout << ans;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}