D. Coins and Queries
Polycarp has nn coins, the value of the ii-th coin is aiai. It is guaranteed that all the values are integer powers of 22 (i.e. ai=2dai=2d for some non-negative integer number dd).
Polycarp wants to know answers on qq queries. The jj-th query is described as integer number bjbj. The answer to the query is the minimum number of coins that is necessary to obtain the value bjbj using some subset of coins (Polycarp can use only coins he has). If Polycarp can't obtain the value bjbj, the answer to the jj-th query is -1.
The queries are independent (the answer on the query doesn't affect Polycarp's coins).
The first line of the input contains two integers nn and qq (1≤n,q≤2⋅1051≤n,q≤2⋅105) — the number of coins and the number of queries.
The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an — values of coins (1≤ai≤2⋅1091≤ai≤2⋅109). It is guaranteed that all aiai are integer powers of 22 (i.e. ai=2dai=2d for some non-negative integer number dd).
The next qq lines contain one integer each. The jj-th line contains one integer bjbj — the value of the jj-th query (1≤bj≤1091≤bj≤109).
Print qq integers ansjansj. The jj-th integer must be equal to the answer on the jj-th query. If Polycarp can't obtain the value bjbj the answer to the jj-th query is -1.
5 4 2 4 8 2 4 8 5 14 10
1 -1 3 2
Codeforces (c) Copyright 2010-2018 Mike Mirzayanov
题意:给出n张钱ai(ai是2的幂,也就是说,ai=2^x,x是任意正整数),给出m次询问,每次给出一个数,问,是否可以用最少的纸币拼出这个数,可以,则输出最少的纸币数,否则,输出-1
思路:由于ai是2的幂,那优先取面值最大的纸币就好了。
#include "iostream"
#include "map"
using namespace std;
typedef long long ll;
map<ll,int> mp;
const int Max=2e5+10;
int main()
{
ios::sync_with_stdio(false);
mp.clear();
int n,m,x;
cin>>n>>m;
for(int i=0;i<n;i++) {cin>>x;mp[x]++;}
while(m--){
int ans=0;
cin>>x;
for(int i=1<<30;i>0;i>>=1){
if(mp[i]){
int t=mp[i]<(x/i)?mp[i]:x/i;
x-=t*i;
ans+=t;
}
if(x==0) break;
}
if(!x) cout<<ans<<endl;
else cout<<"-1"<<endl;
}
return 0;
}