allpf = curpf+pv.at(nextOrder).pf;
return;
}
}else{
int adjacentOrder = nextOrder+1;
if(pv.at(adjacentOrder).btime >= pv.at(nextOrder).etime){
return;
}else{
manageP(static_cast
}
}
}
void test1499(int n){
int i = 0;
Project p;
std::vector
while(i++
//p.id = i;
pv.push_back(p);
}
std::sort(pv.begin(),pv.end(),lessthan);
/*
for(std::vector
}
*/
manageP(-1,0,pv);
std::cout<
int _tmain(int argc, _TCHAR* argv[])
{
int n =0;
while(std::cin>>n){
test1499( n);
}
return 0;
}