Submission #3777793

---

Source Code Expand

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

int main() {
	int N;
	cin >> N;
	vector<int> L(N * 2);
	for (int i = 0; i < N * 2; ++i) { cin >> L[i]; }

	sort(L.begin(), L.end());

	int res = 0;
	for (int i = 0; i < L.size(); i += 2) {
		res += L[i];
	}

	cout << res << endl;

	return 0;
}

Submission Info

Judge Result