ACM Changchun 2015 A. Too Rich

You are a rich person, and you think your wallet is too heavy and full now. So you want to give me some money by buying a lovely pusheen sticker which costs p dollars from me. To make your wallet lighter, you decide to pay exactly pp dollars by as many coins and/or banknotes as possible.

For example, if p = 1 and you have two 10 coins, four 5 coins, and eight 1 coins, you will pay it by two 5coins and seven 1 coins. But this task is incredibly hard since you are too rich and the sticker is too expensive and pusheen is too lovely, please write a program to calculate the best solution.

Input Format

The first line contains an integer Tindicating the total number of test cases.

Each test case is a line with 1 integers p, c1, c5, c10, c20, c50, c100, c200, c500, c1000, c2000, specifying the price of the pusheen sticker, and the number of coins and banknotes in each denomination. The number ci means how many coins/banknotes in denominations of ii dollars in your wallet.

1≤T≤20000

0≤p≤109

0≤ci​≤100000

Output Format

For each test case, please output the maximum number of coins and/or banknotes he can pay for exactly p dollars in a line. If you cannot pay for exactly p dollars, please simply output '-1'.

样例输入复制

3
17 8 4 2 0 0 0 0 0 0 0
100 99 0 0 0 0 0 0 0 0 0
2015 9 8 7 6 5 4 3 2 1 0

样例输出复制

9
-1
36

题目来源

ACM Changchun 2015

/*
某些面值的钱分别有若干个，用这些钱来恰好组成某一金额的钱，问最多需要的钱的数目
逆向思维 用总价减去需求=X
那么贪心来用最少的数目凑成X即可(也可能凑不出来)
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <string>
#include <deque>
using namespace std;
#define ll long long
#define  N 1009
const ll inf =9e18;
#define  gep(i,a,b)  for(int  i=a;i<=b;i++)
#define  gepp(i,a,b) for(int  i=a;i>=b;i--)
#define  gep1(i,a,b)  for(ll i=a;i<=b;i++)
#define  gepp1(i,a,b) for(ll i=a;i>=b;i--)
#define  mem(a,b)  memset(a,b,sizeof(a))
ll   val[]={,,,,,,,,,,};
ll num[],a[];
ll ans,p;
ll sum,ret;
int t;
void  dfs(int  x,ll sum,ll cnt)
{
    if(!sum)
    {
        ans=min(ans,cnt);
        return  ;
    }
    if(x<)  return ;
    a[x]=min(sum/val[x],num[x]);
    dfs(x-,sum-val[x]*a[x],cnt+a[x]);
    if(a[x]>=)
    {
        a[x]--;
        dfs(x-,sum-val[x]*a[x],cnt+a[x]);
    }
    /*
    如 ：  1
           150 0 0 0 3 1 1 0 0 0 0
           如果没有上面的三行就是无解 -1
           但是 dfs(4,60,0) 因为 用了50，后面的就无法凑成10
           但是后面的20*3可以凑成60，因此a[x]可一每次都减1，再去dfs
           这样才能考虑到所有的情况！
    */
}
int  main()
{
    scanf("%d",&t);
    while(t--)
    {
      scanf("%lld",&p);
      mem(a,);
      sum=;
      ret=;
      gep(i,,)
      {
          scanf("%lld",&num[i]);
          ret+=num[i];
          sum+=val[i]*num[i];
      }
      sum-=p;
      if(sum<)
      {
          printf("-1\n");
          continue;
      }
      ans=inf;
      dfs(,sum,);
      if(ans!=inf)
      {
          printf("%lld\n",ret-ans);
      }
      else{
          printf("-1\n");
      }
    }
    return ;
}