任务时间表问题

#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

/*
p(i, d)表示前i个任务，截止时间为d的误时惩罚
p(i, d) = min{ p(i-1,d)+wi, p(i-1, min(d,di)-1) }
p(1, d) = 0   t1 <= d
p(1, d) = wi  t1 > d
*/                                                                                      

const int INF = 100000;
const int MAX = 50;
struct Task
{
    int d; //截止时间
    int w; //误时惩罚

    bool operator < (const Task &t)
    {
        return d < t.d;
    }
};

Task task[50];
int p[MAX][200];

int min(int a, int b)
{
    return a<b? a:b;
}

int greedy(int n)
{
    sort(task, task+n);  //按截止时间排序
    int i, j;
    int d = task[n-1].d; 
    for(i=0; i<n; i++)
        for(j=0; j<=d; j++)
            p[i][j] = INF;

    for(j=0; j<=d; j++)
        if(j >= task[0].d)
            p[0][j] = 0;
        else
            p[0][j] = task[0].w;

    for(i=1; i<n; i++)
    {
        for(j=0; j<=d; j++)
        {
            p[i][j] = p[i-1][j] + task[i].w;
            int jj = min(j, task[i].d);
            if(jj >= 1 && p[i-1][jj-1]<p[i][j])
                p[i][j] = p[i-1][jj-1];
        }
    }
    return p[n-1][d];
}

int main()
{
    ifstream fin("任务时间表.txt");
    cout << "输入任务数：";
    int n;
    fin >> n; cout << n;
    cout << "\n输入完成任务截止时间：\n";
    int i;
    for(i=0; i<n; i++)
    {
        fin >> task[i].d;  
        cout << task[i].d << " ";
    }
    cout << "\n输入任务误时惩罚：\n";
    for(i=0; i<n; i++)
    {
        fin >> task[i].w;  
        cout << task[i].w << " ";
    }
    cout << "\n最小误时惩罚为：" << greedy(n);
    cout << endl;
    cout << endl;
    fin.close();
    return 0;
}