HDU 1300（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int number[105],price[105];int dp[105];int main(){    int T;    scanf("%d",&T);    while(T--)    {        memset(number,0,sizeof(number));        memset(price,0,sizeof(price));        memset(dp,0,sizeof(dp));        int c;        scanf("%d",&c);        int i,j;        for(i=1;i<=c;i++)        {            int temp;            scanf("%d%d",&temp,&price[i]);            number[i]=number[i-1]+temp;        }        for(i=1;i<=c;i++)        {            int Min=99999999;            for(j=0;j<i;j++)            {                    Min=min(Min,dp[j]+(number[i]-number[j]+10)*price[i]);            }            dp[i]=Min;        }        printf("%d\n",dp[c]);    }}