codeforces 1003 D Coins and Queries (贪心+暴力)

版权声明:希望我的博客可以为别人带去知识与便利,让那些像我曾经一样迷茫的小伙伴不再迷茫~ https://blog.csdn.net/qq_34374664/article/details/80925931

D. Coins and Queries
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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).

Input

The first line of the input contains two integers nn and qq (1n,q21051≤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 (1ai21091≤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 (1bj1091≤bj≤109).

Output

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.

Example
input
Copy
5 4
2 4 8 2 4
8
5
14
10
output
Copy
1
-1
3
2

题意: 有n个硬币q次询问,每个硬币为2^d, 每次询问给你一个数,问能否用硬币凑成这个数。

思路:因为都是倍数关系,所以有大的用大的,最多就32个不同的数,所以可以桶装,这里用的反向迭代器

代码:

#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
#include <algorithm>
using namespace std;
map<int, int> mp;
int main()
{
    int n, q, x, cnt = 0;
    scanf("%d%d", &n, &q);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &x);
        mp[x]++;
    }
    while(q--)
    {
        scanf("%d", &x);
        int ans = 0, flag = 0;
        for(map<int,int>::reverse_iterator it = mp.rbegin(); it != mp.rend(); it++)
        {
            int tmp = min(x/it->first, it->second);
            ans += tmp;
            x -= tmp * it->first;
            if(!x) break;
        }
        if(!x) printf("%d\n", ans);
        else puts("-1");
    }
    return 0;
}






阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页