B. Color the Fence

time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to win Tanya's heart he has.  Unfortunately, Igor could only get v liters of paint. He did the math and concluded that digit d requires ad liters of paint. Besides, Igor heard that Tanya doesn't like zeroes. That's why Igor won't use them in his number. Help Igor find the maximum number he can write on the fence. Input The first line contains a positive integer v (0 ≤ v ≤ 106). The second line contains nine positive integers a1, a2, ..., a9 (1 ≤ ai ≤ 105). Output Print the maximum number Igor can write on the fence. If he has too little paint for any digit (so, he cannot write anything), print -1. Examples Input Copy 5 5 4 3 2 1 2 3 4 5 Output Copy 55555 Input Copy 2 9 11 1 12 5 8 9 10 6 Output Copy 33 Input Copy 0 1 1 1 1 1 1 1 1 1 Output Copy -1

思路：

貪心，找到最小權值，然後暴力嘗試替換

程式碼：

#include<bits/stdc++.h>
using namespace std;
int num[10];
int main()
{
    int v,mmin = 1e7;
    scanf("%d",&v);
    for (int i = 1;i < 10;i ++)
    {
        scanf("%d",&num[i]);
        if (num[i] <= mmin) mmin = num[i];
    }
    if (v < mmin)
    {
        puts("-1\n");
        return 0;
    }
    int t = v / mmin;
    while (t --)
        for (int i = 9;i >= 1;i --)
        {
            if (v >= num[i] && (v - num[i]) / mmin >= t)
            {
                printf("%d",i);
                v -= num[i];
                break;
            }
        }
    putchar('\n');
    return 0;
}