提出 #5254118

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

ll calc_coin_num(ll price){
    vector<ll> coins;
    FOR(i, 0, 10){
        ll a = pow(10, i);
        coins.push_back(a);
        coins.push_back(5*a);
    }
    sort(ALL(coins), greater<ll>());

    ll count = 0;
    for(ll coin : coins){
        if(price>=coin){
            ll num = price/coin;
            price %= coin;
            count += num;
        }
    }
    return count;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N, K;
    cin >> N >> K;

    vector<ll> A(N);
    FOR(i, 0, N){
        cin >> A.at(i);
    }

    vector<ll> F(N);
    FOR(i, 0, K){
        F[i] = 1;
    }
    sort(ALL(F));

    ll mi = inf;
    do {
        ll price = 0;
        FOR(i, 0, N){
            if(F[i]==1){
                price += A[i];
            }
        }
        ll coin_num = calc_coin_num(price);
        mi = min(mi, coin_num);
    } while (std::next_permutation(ALL(F)));

    p(mi);

    return 0;
}

提出情報

ジャッジ結果