B_Color_the_Fence.cpp

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
const long long mod = 1e9 + 7;
#define INF (1LL << 60)
#define inf (1 << 30)
#define all(x) (x).begin(), (x).end()

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x << " "; _print(x); cerr << endl;
#else
#define debug(x)
#endif

void _print(ll t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(lld t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(ull t) { cerr << t; }

template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);

template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);

template <class T, class V> void _print(pair <T, V> p) {
    cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";
}
template <class T> void _print(vector <T> v) {
    cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";
}
template <class T> void _print(set <T> v) {
    cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";
}
template <class T> void _print(multiset <T> v) {
    cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";
}
template <class T, class V> void _print(map <T, V> v) {
    cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";
}








void solve(){
    int n;
    cin>>n;
    vector<int> vec(9+1);
    int min_cost=INT_MAX;
    for(int i=1;i<=9;i++){
        cin>>vec[i];
        min_cost=min(min_cost,vec[i]);
    }
    if(n<min_cost){
        cout<<-1<<"\n";
        return;
    }
    int max_digits = n / min_cost; // Maximum number of digits we can form
    n %= min_cost; // Remaining paint after forming max_digits
    
    string result(max_digits, '0'); // Placeholder for the result
    
    for (int i = 0; i < max_digits; i++) {
        // Try to replace the current digit with the largest possible digit
        for (int d = 9; d >= 1; d--) {
            int remaining_paint = n + min_cost; // Include cost of current placeholder
            if (remaining_paint >= vec[d]) {
                result[i] = '0' + d;
                n= remaining_paint - vec[d];
                break;
            }
        }
    }
    
    cout << result << endl;
    
}

int main() {
    #ifndef ONLINE_JUDGE
        freopen("Error.txt", "w", stderr);
    #endif
    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int test=1;
    // cin>>test;
    while(test--){
         solve();
    }
    
    return 0;
}