codeforces 19B Checkout Assistant (背包)

#include<iostream>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<vector>
#include<map>
using namespace std;
typedef long long lld;
const int oo=0x3f3f3f3f;
const lld OO=1LL<<61;
const int MOD=1000000007;
#define maxn 2005
lld dp[maxn];

int main()
{
    int t,c,n;
    while(scanf("%d",&n)!=EOF)
    {
        memset(dp,0x3f,sizeof dp);
        dp[0]=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d %d",&t,&c);
            for(int j=n;j>=0;j--)
            {
                dp[min(j+t+1,n)]=min(dp[min(j+t+1,n)],dp[j]+c);
            }
        }
        printf("%I64d\n",dp
);
    }
    return 0;
}
/**
abacaba
1
abdcaba
2
abdcaba
5
abacababababbcbabcd
3

*/