完美世界笔试题-小萌的包裹

#include<iostream>
using namespace std;

const int maxn = 20;
int A[maxn], n, c, bn, ans;

void f(int cur, int put, int packNum, int packMass, int itemNum)
{
    if(packNum > bn)
    {
        ans = max(ans, itemNum - 1);
        return;
    }
    if(cur == n || ((put == 1) && (A[cur] > c)))
    {
        ans = max(ans, itemNum);
        return;
    }
    if(!put)
    {
        f(cur + 1, 0, packNum, packMass, itemNum);
        f(cur + 1, 1, packNum, packMass, itemNum);
    }
    else
    {
        if(A[cur] + packMass > c)
        {
            f(cur + 1, 0, packNum + 1, A[cur], itemNum + 1);
            f(cur + 1, 1, packNum + 1, A[cur], itemNum + 1);
        }
        else
        {
            f(cur + 1, 0, packNum, packMass + A[cur], itemNum + 1);
            f(cur + 1, 1, packNum, packMass + A[cur], itemNum + 1);
        }
    }
}

int main()
{
    int t;
    cin >> t;
    while(t --)
    {
        cin >> n >> c >> bn;
        for(int i = 0 ;i < n ; i++)
        {
            cin >> A[i];
        }
        ans = 0;
        f(0, 0, 1, 0, 0);
        f(0, 1, 1, 0, 0);
        cout << ans << endl;
    }
}