codeforces 1003 D Coins and Queries （贪心+暴力）

最新推荐文章于 2020-03-26 09:19:14 发布

键盘里的青春

最新推荐文章于 2020-03-26 09:19:14 发布

阅读量444

点赞数

分类专栏： stl

本文链接：https://blog.csdn.net/qq_34374664/article/details/80925931

版权

stl 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

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 \leq n, q \leq 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 \leq a_{i} \leq 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 \leq b_{j} \leq 10^{9}$ ).

Output

Print $q$ integers $a n 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.

题意：有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;
}