Coins and Queries(map和贪心)

Polycarp has nn coins, the value of the ii-th coin is aiai. It is guaranteed that all the values are integer powers of 2 (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 n and q (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).

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
5 4
2 4 8 2 4
8
5
14
10
Output
1
-1
3
2
题意：n个硬币，q次询问。第二行给你n个硬币的值（保证都是2的次幂），每次询问组成x块钱至少需要多少硬币

两种方法:
1.map逆序
2.由二进制表示一个数可知，任何一个数均能由若干个数（均为2的次幂）的和构成，要想用最少的硬币凑成x，则应该尽量用面值比较大的硬币，所以，从大到小枚举硬币面值。
代码1:

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<map>
using namespace std;
#define ll long long
#define oo 0x3f3f3f3f
#define exp 1e-6
map <int ,int>mp;
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++)
    {
        int x;
        scanf("%d",&x);
        mp[x]++;
        //下标的方式插入，如果原本key不存在则会先创建对应的记录，然后再进行赋值；
    }
    while(m--)
    {
        int ans=0,flag=0,x;
        scanf("%d",&x);
        map<int ,int >::reverse_iterator it; 
        //reverse_iterator是反向迭代器，
        //mp.rbegin()就是指向最后一个
        for(it=mp.rbegin();it!=mp.rend();it++)
        {
            int tep=min(x/it->first,it->second);
            ans+=tep;
            x=x-tep*it->first;
            if(!x)
            {
                flag=1;
                break;
            }
       }
        if(flag==1)
            cout<<ans<<endl;
        else
            cout<<"-1"<<endl;
    }


    return 0;
}

代码2:

#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <set>

typedef long long LL;
const long long INF = 0x3f3f3f3f;
const long long mod = 1e9+7;
const double PI = acos(-1.0);
const int dir4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir8[8][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}, {1, 1}, {-1, -1}, {1, -1}, {-1, 1}};

using namespace std;
const int N= 2e5+5;
map<int,int>mp;
int main()
{
    int n,q;
    while(~scanf("%d%d",&n,&q))
    {
        for(int i=1; i<=n; i++)
        {
            int x;
            scanf("%d",&x);
            mp[x]++;
        }
        while(q--)
        {
            int x;
            scanf("%d",&x);
            int ans=0;
            for(int i=1<<30; i>=1; i/=2)
            {
                int k= min(mp[i],x/i); // 从大到小开始遍历,如果出现了x/i的个数,在两者之间选取最小值, 
                ans+=k;     //用了几个数据想加
                x-=k*i;  
            }
            if(x)
                printf("-1\n");
            else
                printf("%d\n",ans);
        }
    }
    return 0;
}