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] %= 5;
        cnt[p[i]]++;
    }

    int res = 0;
    // int take = min(cnt[3], cnt[4]);

    // for (int t = 0; t <= take; t++) {
    //     int ans = 0;
    //     ans += take * 2;

    //     ans += ((cnt[3] - take) / 2);
    //     ans += ((cnt[4] - take) / 3) * 2;

    //     ans += cnt[1];
    //     ans += cnt[2] * 2;
    //     res = max(res, ans);
    // }

    // int take = min(cnt[3], cnt[4]);
    int take = cnt[4] / 3;

    for (int t = 0; t <= take; t++) {
        int ans = 0;
        ans += take * 2; // 4 4 4

        int pair = min(cnt[3], cnt[4] - take * 3);
        ans += ((cnt[3] - pair) / 2); // 3 3
        ans += pair * 2; // 3 4

        ans += cnt[1];
        ans += cnt[2] * 2;
        res = max(res, ans);
    }


    cout << sum - res << '\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