Submission #806352

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define FOR(i, a, n) for(int i = (a); i < (n); i++)
#define REP(i, n) for(int i = 0; i < (n); i++)
#define SZ(x) ((int) (x).size())
#define mp(x,y) make_pair((x), (y))
#define mp3(x,y,z) make_pair((x), make_pair( (y), (z)))
#define foreach(C, i) for(auto i = (C).begin(); i != (C).end(); i++)
#define xx first
#define yy second
#define clr clear()
#define var(x) cout<< #x << " = "<<x<<"\n";
#define print(x) for_each((x).begin(), (x).end(), [](auto n) { cout<<x<<" " })
typedef int32_t i3;
typedef int64_t i6;
typedef vector<i3> vi;
typedef pair<i3,i3> pii;
typedef vector<pair<i3,i3> > vpii;
template class 	std::vector<int> ;


int main()
{
	int n; cin >> n;
	vector<int> vec(2*n);
	REP(i,2*n)
		cin >> vec[i];
	sort(all(vec));
	int cost = 0;
	for(int i = 0; i < SZ(vec) - 1; i += 2)
		cost += min(vec[i], vec[i+1]);
	cout << cost << "\n";
}

Submission Info

Judge Result