hdu 1300 Pearls

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
#define MAX_N 100005
#define INF 1000000000

int main()
{
    int t, c, a[1003], p[1003], dpp[102];
    cin>>t;
    while (t--)
    {
        cin>>c;
        for (int i = 1; i <= c; i++)
            cin>>a[i]>>p[i];

        for (int i = 0; i <= c; i++)
            dpp[i] = INF;
        dpp[0] = 0;

        dpp[1] = (a[1]+10)*p[1];
        for (int i = 2; i <= c; i++)
        {
            dpp[i] = dpp[i-1]+(a[i]+10)*p[i];
            int tmp, tc = a[i];
            for (int j = i-1; j > 0; j--)
            {
                tc += a[j];
                tmp = (tc+10)*p[i] + dpp[j-1];
                if (tmp < dpp[i])
                    dpp[i] = tmp;
               // else     //之前加了这个判断就wa了。。。
                   // break;
            }
        }
        cout<<dpp[c]<<endl;
    }
}