Hoj 2196 Job Scheduling by Open Bidding

题目链接：http://acm.hit.edu.cn/hoj/problem/view?id=2196

典型0/1背包问题：

参考模型：http://blog.csdn.net/niuox/article/details/8556054

注意输出格式：

#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;

int c[505];
double w[505];
double f[2005];
int ti;

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("in.txt","r",stdin);
    #endif
    int t;
    int n;
    int r = 0;
    scanf("%d",&t);
    while(t--)
    {
        r++;
        memset(f,0,sizeof(f));
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf(" %d %lf",&c[i],&w[i]);
        }
        scanf("%d",&ti);

        for(int i=0;i<n;i++)
        {
            for(int j=ti;j>=c[i];j--)
            {
                if(f[j]>f[j-c[i]] + w[i])
                {
                    f[j] = f[j];
                }
                else
                {
                    f[j] = f[j-c[i]] + w[i];
                }
            }
        }
        int minTime = 0;
        double maxSum = 0;
        for(int i=1;i<=ti;i++)
        {
            if(f[i]>maxSum)
            {
                minTime = i;
                maxSum = f[i];
            }
        }
        printf("Problem %d: %d seconds scheduled for $%.2lf\n",r,minTime,maxSum);
    }
    return 0;
}