Submission #3619546

---

Source Code Expand

#include <bits/stdc++.h>

#define vec(v) vector<int>(v)
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define mapci(mp) map<char*,int>(mp)
#define mapcc(mp) map<char*,char*>(mp)
typedef long long ll;
using namespace std;

int main(){
	int n,ans=0;
	cin>>n;
	int s[n];
	for(int i=0;i<n;i++){
		cin>>s[i];
		ans+=s[i];
	}
	sort(s,s+n);
	if(ans%10==0){
		for(int i=0;i<n;i++){
			if(s[i]%10!=0){
				ans-=s[i];
				cout << ans<<endl;
				return 0;
			}
		}
		cout << 0<<endl;
	}
	else{
		cout <<ans<<endl;
	}
	return 0;
}

Submission Info

Judge Result