Codeforces--1003D--Coins and Queries_codeforces 1003d-CSDN博客

本文介绍了一个关于硬币组合的问题，给定若干个面值为2的幂次方的硬币，以及一系列目标值，需要计算最少使用多少个硬币能够组合出目标值，采用贪心算法解决，并提供了具体实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述：
Polycarp has n coins, the value of the i-th coin is ai. It is guaranteed that all the values are integer powers of 2 (i.e. ai=2d for some non-negative integer number d).
Polycarp wants to know answers on q queries. The j-th query is described as integer number bj. The answer to the query is the minimum number of coins that is necessary to obtain the value bj using some subset of coins (Polycarp can use only coins he has). If Polycarp can’t obtain the value bj, the answer to the j-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 n and q (1≤n,q≤2⋅105) — the number of coins and the number of queries.

The second line of the input contains n integers a1,a2,…,an — values of coins (1≤ai≤2⋅109). It is guaranteed that all ai are integer powers of 2 (i.e. ai=2d for some non-negative integer number d).

The next q lines contain one integer each. The j-th line contains one integer bj — the value of the j-th query (1≤bj≤109).
输出描述:
Print q integers ansj. The j-th integer must be equal to the answer on the j-th query. If Polycarp can’t obtain the value bj the answer to the j-th query is -1.
输入：
5 4
2 4 8 2 4
8
5
14
10
输出：
1
-1
3
2
题意：
给你n个硬币，每个硬币的面值都为2的幂次方。先有q个询问，每个询问给出一个数b，问你至少用多少个硬币才能使得他们的面值凑成b。若不能凑出，则输出-1。
题解：
贪心，用map存下来所有有的数，然后从大到小算。
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;

const int maxn = 200000 + 5;

int main(){
    int n,q,x,num;
    map<int,int>mp;
    while(scanf("%d%d",&n,&q)!=EOF){
        mp.clear();
        for(int i = 1; i <= n; i ++){
            scanf("%d",&x);
            mp[x] ++;
        }
        for(int i = 1; i <= q; i ++){
            int ans = 0;
            scanf("%d",&num);
            for(int j = 1<<30; j >= 1; j >>= 1){
                if(mp[j] != 0){
                    int t = min(mp[j],num / j);
                    num -= t * j;
                    ans += t;
                }
            }
            if(num){
                cout<<"-1"<<endl;
            }
            else{
                cout<<ans<<endl;
            }
        }

    }
    return 0;
}