1068. Find More Coins (30)

可能排序太费时间，用map话对于重复的直接次数+1即可，不需要排序

最后个测试点超时的代码

#include<iostream>
#include<vector>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
int N, M;
vector<int> all;
int add = 0;vector<int> path;
void traver(int index)
{
    if (add == M)
    {
        int flag = 0;
        for (auto x : path)
            if (flag == 0) {
                printf("%d", x);flag = 1;
            }
            else printf(" %d", x);
            printf("\n");
            exit(0);
    }
    if (add + all[index + 1] > M) return;
    for (int t = index + 1;t < N;t++)
    {
        if (add + all[t] > M) break;
        path.push_back(all[t]);
        add += all[t];
        traver(t);
        path.pop_back();
        add -= all[t];
    }
}

int main()
{
    scanf("%d %d", &N, &M);
    all.resize(N);
    for (int t = 0;t < N;t++)
        scanf("%d", &all[t]);
    sort(all.begin(), all.end());

    for (int t = 0;t < N;t++)
    {
        if (all[t] > M) break;
        path.push_back(all[t]);
        add = all[t];
        traver(t);
        path.pop_back();
    }
    printf("No Solution\n");
}

通过的代码

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
int N, M;
map<int,int> all;
int add = 0;
vector<int> path;
bool findc(int M)
{
    auto it = all.begin();
    while (it!=all.end() && it->first <= M)
    {
        if (it->second)
        {
            it->second--;
            if ((*it).first == M) {
                path.push_back(it->first);
                return true;
            }
            else if (findc(M - it->first)) {
                path.push_back(it->first);
                return true;
            }
            else
            {
                it->second++;
            }
        }
        it++;;
    }
    return false;
}

int main()
{
    scanf("%d %d", &N, &M);
    for (int t = 0;t < N;t++)
    {
        int temp;
        scanf("%d", &temp);
        if (temp <= M)
            all[temp] += 1;
    }
    if(!findc(M))   printf("No Solution\n");
    else
    {
        int first=1;
        for (auto it = path.rbegin();it != path.rend();it++)
            if (first)
            {
                printf("%d", *it);
                first--;
            }
            else
                printf(" %d", *it);
        cout << endl;
    }

}