Codeforces 349 B 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 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

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

题意：给v份颜料，然后给9个数据，每个数据的意思是要打印出对应的数字需要ai份颜料，要求输出可以打印出的最大的数字

贪心：肯定是除以用的颜料数，让他位数最多，那样肯定就是最大了。。每一位，从高往低看一下，能不能换成一个大一点数。。具体做法就是，先确定最多的位数，然后每一位都从大数尝试一下。。

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
int n,i = 0, cnt = 0;
int min1 = 1e9, a[9];
scanf("%d",&n);
for(i = 0; i < 9; i++)
{
scanf("%d", &a[i]);
min1 = min(min1, a[i]);
} if(n < min1)
printf("-1");
cnt = n / min1; //一共有cnt个数，这是确定的了，位数比他小肯定就比他笑了
while(cnt--) //这个写法相当漂亮
{
for(i = 8;i >= 0; i--)
if((n-a[i]) / min1 == cnt && n-a[i] >= 0)
{
printf("%d", i+1);
break;
}
n = n - a[i];
}

return 0;
}