Submission #7856034

---

Source Code Expand

#include<bits/stdc++.h>
typedef long long ll;
ll gi(){
	ll x=0,f=1;
	char ch=getchar();
	while(!isdigit(ch))f^=ch=='-',ch=getchar();
	while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
	return f?x:-x;
}
int L[210];
int main(){
	int n=gi();
	for(int i=1;i<=n+n;++i)L[i]=gi();
	std::sort(L+1,L+n+n+1);
	int ans=0;
	for(int i=1;i<=n+n;i+=2)ans+=L[i];
	printf("%d\n",ans);
	return 0;
}

Submission Info

Judge Result