Pearls(dp)

http://poj.org/problem?id=1260

#include <cstdio>
#include <iostream>
#include <cmath>

using namespace std;
int main()
{
    int t,dp[120],s[120];
    cin>>t;
    while(t--)
    {
        int n,ai[120],pi[120];
        cin>>n;
        s[0] = 0;
        for (int i = 1; i <= n; i++)
        {
            cin>>ai[i]>>pi[i];
            s[i] = s[i-1]+ai[i];
        }
        dp[0] = 0;
        for (int i = 1; i <= n; i++)
        {
            dp[i] = (ai[i]+10)*pi[i]+dp[i-1];
            for (int j = 0; j < i; j++)
            {
                dp[i]=min(dp[i],dp[j]+(s[i]-s[j]+10)*pi[i]);
            }
        }
        cout<<dp[n]<<endl;
    }
    return 0;
}