CodeForces 349B Color the Fence （贪心）

B. Color the Fence

time limit per test:2 seconds

memory limit per test:256 megabytes

input:standard input

output:standard 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 digitd requires a_d 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 ≤ 10⁶). The second line contains nine positive integersa₁, a₂, ..., a₉(1 ≤ a_i ≤ 10⁵).

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.

Sample test(s)

Input

5
5 4 3 2 1 2 3 4 5

Output

55555

Input

2
9 11 1 12 5 8 9 10 6

Output

33

Input

0
1 1 1 1 1 1 1 1 1

Output

-1

题意：

在墙上用一定量的油漆涂数字，尽量使涂出来的数字大。

输入：

1.拥有油漆量

2.每个数字所需颜料量

思路：

一开始想到动态规划每个数字，后来发现对数字的存储上很大问题，最多要存放10^6位数字。

后来换了思路，使用贪心的想法，从高位开始每次输出最优数字。

/*************************************************************************
	> File Name: BB.cpp
	> Author: BSlin
	> Mail:  
	> Created Time: 2013年10月04日 星期五 19时16分55秒
 ************************************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <iterator>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#define MP make_pair
#define INF (1<<30)
#define PI acos(-1.0)
#define esp 1e-8
const int dx[4]={0,0,0,0};
using namespace std;
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#if defined (_WIN32) || defined (__WIN32) || defined (WIN32) || defined (__WIN32__)
#define LL __int64
#define LLS "%" "I" "6" "4" "d"
#else
#define LL long long
#define LLS "%" "l" "l" "d"
#endif



#define MAX 100010

int a[10];

int main(int argc, char** argv) {
    //read;
    int value,min,cnt;
    scanf("%d",&value);
    min = MAX;
    for(int i=1; i<=9; i++) {
        scanf("%d",&a[i]);
        if(min > a[i]) min = a[i];
    }
    if(value < min) {
        printf("-1\n");
        return 0;
    }
    cnt = value / min;
    for(int i=cnt-1; i>=0; i--) {
        for(int j=9; j>=1; j--) {
            if(value >= a[j] && (value - a[j]) / min >= i) { //注意：-1/2==0；value >= a[j]；
                printf("%d",j);
                value -= a[j];
                break;
            }
        }
    }
    printf("\n");
    return 0;
}