Submission #1689533

---

Source Code Expand

#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <unordered_map>
#include <vector>


#define INF 4000000000000000000LL
#define MOD 1000000007
#define ALL(x) std::begin(x), std::end(x)


int main(int argc, char** argv)
{
  std::cin.tie(0);
  std::ios_base::sync_with_stdio(0);

  std::cout << std::fixed << std::setprecision(6);

  int N, s[111], S = 0;

  std::cin >> N;

  for (int i = 0; i < N; i ++) {
    std::cin >> s[i];

    S += s[i];
  }

  if (S % 10 == 0) {
    std::sort(s, s + N);

    for (int i = 0; i < N; i ++)
      if (s[i] % 10) {
        S -= s[i];

        break;
      }

    if (S % 10 == 0)
      S = 0;
  }

  std::cout << S << std::endl;

  return 0;
}

Submission Info

Judge Result