Submission #2557696

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define LL long long
// sort(a.begin(), a.end(), std::greater<int>());
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> non10;
    int sum = 0;
    rep(i, n)
    {
        cin >> a[i];
        sum += a[i];
        if (a[i] % 10 != 0)
        {
            non10.push_back(a[i]);
        }
    }
    SORT(a);
    if (sum % 10 != 0)
        cout << sum << endl;
    else if (non10.size() == 0)
        cout << 0 << endl;
    else
    {
        SORT(non10);
        cout << sum - non10[0] << endl;
    }
    return 0;
}

Submission Info

Judge Result