Submission #8090373

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {

    int n;
    cin >> n;
    vector<int> vec(2 * n);
    for (int i = 0; i < 2 * n; i++) {
        cin >> vec[i];
    }
    sort(vec.begin(), vec.end(), std::greater<int>());

    int ans = 0;
    for (int i = 0; i < 2*n ; i+=2) {

        ans += min(vec[i], vec[i + 1]);
    }
    cout << ans << endl;

   return 0;
}

Submission Info

Judge Result