Cent saving

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 1e5 + 5;

int n, p[N];
int cnt[10];

void solve() {
    cin >> n;
    memset(cnt, 0, sizeof cnt);
    int sum = 0;
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
        sum += p[i];
        p[i] %= 10;
        cnt[p[i]]++;
    }

    int ans = 0;
    // connect 4 & 9 first

    // take 4 from 3
    {
        int take = min(cnt[4], cnt[3]);
        cnt[4] -= take;
        cnt[3] -= take;
        ans += take * 2;
    }
    // take 4 from 8
    {
        int take = min(cnt[4], cnt[8]);
        cnt[4] -= take;
        cnt[8] -= take;   
        ans += take * 2; 
    }

    // take 9 from 3
    {
        int take = min(cnt[9], cnt[3]);
        cnt[9] -= take;
        cnt[3] -= take;  
        ans += take * 2;
    }
    // take 9 from 8
    {
        int take = min(cnt[9], cnt[8]);
        cnt[9] -= take;
        cnt[8] -= take;   
        ans += take * 2;   
    }

    // take 3 with 8
    {
        int take = min(cnt[3], cnt[8]);
        cnt[3] -= take;
        cnt[8] -= take;   
        ans += take;       
    }

    // take 3 & 3
    {
        int take = cnt[3] / 2;
        ans += take;
    }

    // take 3 & 3
    {
        int take = cnt[8] / 2;
        ans += take;
    }

    ans += cnt[1] + cnt[2] * 2 + cnt[6] + cnt[7] * 2;
    cout << sum - ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int t;
    cin >> t;

    while (t--) {
        solve();
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER