计蒜客蓝桥杯模拟赛5 礼物盒

#include<iostream>
#include<algorithm>

using namespace std;

int box[36][2]={{11,3},{8,12},{11,17},{16,13},{1,14},{2,8},{6,10},{10,18},{17,11},{10,15},{6,14},{5,6},{2,19},{19,10},{4,9},{7,9},{5,14},{5,20},{15,19},{3,17},{15,11},{7,25},{11,20},{9,12},{17,4},{9,19},{4,18},{10,10},{12,19},{17,3},{19,9},{20,16},{11,16},{10,2},{20,15},{3,14}};
int x[36];
int cnt = 0;

void dfs(int num,int index,int width)
{   
    if(width == 100)
    {
        if(cnt<num)
        {
            //for(int i = 0; i < 36; i++)
            //{
            //  if(x[i])
            //  {
            //      cout << x[i] << " ";
            //  }
            //}
            //cout << endl;
            cnt = num;
        }
        return ;
    }
    if(width > 100||index==36)
    {
        return ;
    }
    if(box[index][1]<=20)
    {
        x[index] = box[index][0];
        dfs(num+1,index+1,width+box[index][0]);
        x[index] = 0;
    }
    dfs(num,index+1,width);
}
int main()
{
    dfs(0,0,0);
    cout << cnt;//18
}