D - Doing Homework(状压dp

#include
using namespace std;
const int N=1e6+10;
struct node{
	string name;
	int dl,nd;
}cs[20];
struct DP{
	int now,score,pre;
}dp[1<<16];
int t,n;
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
//		memset(cs,0,sizeof cs);
		memset(dp,0,sizeof dp);
//		cout<<1<>cs[i].name>>cs[i].dl>>cs[i].nd;
			cin>>cs[i].name;
			scanf("%d%d",&cs[i].dl,&cs[i].nd);
		}
		for(int i=0;i<(1<cs[j+1].dl) nd+=tim-cs[j+1].dl;
				if(nd v;
		while(now!=-1){
			v.push_back(cs[now+1].name);
//			cout<=0;i--) cout<