刚学DFS，求助大佬

// Problem: P1460 [USACO2.1] 健康的荷斯坦奶牛 Healthy Holsteins
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P1460
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
const int N=30;
int v,g,V[N],sum[N],res=0x3f3f3f3f;
vector<int>G[N];
int path[N];//记录状态
bool vis[N];//判重
vector<int>ip;
bool check()
{
	for(int i=1;i<=v;i++)
	   if(sum[i]<V[i])return false;
	return true;
}
void dfs(int u,int cnt)
{
	if(check())
	{
		if(res>cnt)//更改答案
		{
			res=cnt;
			ip.clear();
			for(int i=1;i<=u-1;i++)ip.push_back(path[i]);
		}
		return ;
	}
    for(int i=1;i<=g;i++)
	    if(!vis[i])
		  {
			path[u]=i;
			vis[i]=true;
			for(int j=1;j<=v;j++)sum[j]+=G[i][j-1];//计算和
			dfs(u+1,cnt+1);//向下搜索
			for(int j=1;j<=v;j++)sum[j]-=G[i][j-1];//回溯
			vis[i]=false;
		  }
}
int main()
{
	ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
	cin>>v;
	for(int i=1;i<=v;i++)cin>>V[i];
	cin>>g;
	for(int i=1;i<=g;i++)
	    for(int j=1,x;j<=v;j++)
	        {cin>>x;G[i].push_back(x);}
	dfs(1,0);
	cout<<res<<" ";
	for(int i=0;i<ip.size();i++)cout<<ip[i]<<" ";
	return 0;
}