【codeforces 1003D】Coins and Queries（思维）

D. Coins and Queries

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp has $n$ coins, the value of the $i$-th coin is $a_i$. It is guaranteed that all the values are integer powers of $2$ (i.e. $a_i=2^d$ for some non-negative integer number $d$).

Polycarp wants to know answers on $q$ queries. The $j$-th query is described as integer number $b_j$. The answer to the query is the minimum number of coins that is necessary to obtain the value $b_j$ using some subset of coins (Polycarp can use only coins he has). If Polycarp can't obtain the value $b_j$, the answer to the $j$-th query is -1.

The queries are independent (the answer on the query doesn't affect Polycarp's coins).

Input

The first line of the input contains two integers $n$ and $q$ ($1\le n,q\le 2\cdot {10}^5$) — the number of coins and the number of queries.

The second line of the input contains $n$ integers $a_1,a_2,\dots ,a_n$ — values of coins ($1\le a_i\le 2\cdot {10}^9$). It is guaranteed that all $a_i$ are integer powers of $2$ (i.e. $a_i=2^d$ for some non-negative integer number $d$).

The next $q$ lines contain one integer each. The $j$-th line contains one integer $b_j$ — the value of the $j$-th query ($1\le b_j\le {10}^9$).

Output

Print $q$ integers $an{s}_j$. The $j$-th integer must be equal to the answer on the $j$-th query. If Polycarp can't obtain the value $b_j$ the answer to the $j$-th query is -1.

Example

input

Copy

5 4
2 4 8 2 4
8
5
14
10

output

Copy

1
-1
3
2

从小到大进行枚举即可.

#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
#define MAXN 200050
int coin[MAXN];
int mon;
int n;
int q;
map<int,int> mmp;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>q;
	for(int i=0;i<n;i++) 
	{
		cin>>coin[i];
		mmp[coin[i]]++;
	}
	sort(coin,coin+n);
	while(q--)
	{
		int flag=0;
		cin>>mon;
		int ans=0;
		for(int i=1<<30;i>=1;i/=2)
		{
			ans+=min(mmp[i],mon/i);
			mon-=i*min(mmp[i],mon/i);
		}
		if(mon) cout<<-1<<endl;
		else cout<<ans<<endl;
	}
	return 0;
}