BOJ 15008 - Falling Apart [C++]

문제

링크

풀이

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
  vector<int> a(n);
  for (int i=0; i<n; i++) cin >> a[i];
  sort(a.begin(), a.end(), greater<int>());
 
  int x = 0, y = 0;
  for (int i=0; i<n; i++) {
    if (i & 1) y += a[i];
    else x += a[i];
  }
  cout << x << " " << y;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}