poj1260

dp。

#include<iostream>
#include<algorithm>
using namespace std;
const int inf = 1e9;
int ca;
int c;
int a[105], p[105];
int sum[106];
int dp[106];
int main()
{
    cin >> ca;
    while(ca --)
    {
        fill(dp, dp + 106, inf);
        dp[0] = 0;
        cin >> c;
        for(int i = 0; i < c; i ++)
            cin >> a[i] >> p[i];
        for(int i = 1; i <= c; i ++)
            sum[i] = sum[i - 1] + a[i - 1];
        for(int i = 1; i <= c; i ++)
            for(int j = 0; j < i; j ++)
                dp[i] = min(dp[i], dp[j] + (sum[i] - sum[j] + 10) * p[i - 1]);
        cout << dp[c] << endl;
    }
    // system("pause");
    return 0;
}