[USACO][枚举]Healthy Holsteins

/*
ID :ggy_7781
TASK :holstein
LANG :C++11
*/
#include <bits/stdc++.h>

using namespace std;
#define maxV 29
#define maxG 15

int V,G;

int target[maxV];
int a[maxG][maxV];
bool cmp(int a[], int b[])
{
    for(int i = 0;i <V;i ++)
        if(a[i] > b[i])
        return false;
    return true;
}
int main()
{
    freopen("holstein.in","r",stdin);
    freopen("holstein.out","w",stdout);
    cin>>V;
    for(int i =0 ;i < V;i ++)
        cin>>target[i];
    cin>>G;
    for(int i =0 ;i <G;i ++)
    {
        for(int j = 0;j < V;j ++)
        {
            cin>>a[i][j];
        }
    }
    int ret = G;
    int method = pow(2,G) - 1;
    for(int i = 1;i < pow(2,G);i ++)
    {
        int tmp = i;
        int now[maxV];
        for(int k = 0;k <V;k ++)
            now[k] = 0;
        int num = 0;
        for(int j = 0;j < G;j ++)
        {
            //cout<<(tmp & 1);
            if(tmp & 1)
            {
                num ++;
                for(int k = 0;k <V;k ++)
                    now[k] = now[k] + a[j][k];
            }
            tmp = tmp >> 1;
        }
        if(cmp(target,now) && num < ret)
        {
            ret = num;
            method = i;
        }
        //cout<<endl;
    }
    cout<<ret;
    int tmp = method;
    for(int i = 0;i < G; i++)
    {
        if(tmp & 1)
            cout<<" "<<i+1;
        tmp = tmp >> 1;
    }
    cout<<endl;
    return 0;
}