Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his score of the final test, 1 day for 1 point. And as you know, doing homework always takes a long time. So Ignatius wants you to help him to arrange the order of doing homework to minimize the reduced score.
2 3 Computer 3 3 English 20 1 Math 3 2 3 Computer 3 3 English 6 3 Math 6 3
2 Computer Math English 3 Computer English Math
dp問題
#includeusing namespace std; #include #include struct Q{ string s; int d; int c; }; struct DPT{ int time; int pos; int last; int score; }; DPT *dp; Q *q; int main() { freopen("C:\\in.txt","r",stdin); int T; const int INF=0x7fffffff; cin>>T; while(T--){ int N; cin>>N; q=new Q[N]; dp=new DPT[1< >q[i].s>>q[i].d>>q[i].c; } int end=1< =0;i--){ recent=1<path; recent=end-1; while(recent){ //cout<