Cent saving

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
const int N = 2e5 + 5;
 
int n, p[N];
int cnt[5];
 
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];
 
        cnt[p[i] % 5]++;
    }
 
    int res = 0;
    int take = min(cnt[3], cnt[4]);
 
    for (int t = 0; t <= take; t++) {
        int ans = 0;
        ans += t * 2;
        
        int f = (cnt[4] - t) / 3; 
        int th = (cnt[3] - t) / 2;
        
        ans += -((cnt[4] - t) % 3);
        ans += -((cnt[3] - t) % 2) * 2;
        
        ans += th;
        ans += f * 2;
 
        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: ACCEPTED

Test 2

Verdict: ACCEPTED