POJ 1260 珍珠

#include<cstdio>
#include<cstring>
#define MAXN 1001
long f[MAXN],sum[MAXN],a[MAXN],p[MAXN];
long t,c;
long min(long a,long b)
{
return a<b?a:b;
}
int main(void)
{
long i,j;
scanf("%ld",&t);
while(t--)
{
scanf("%ld",&c);
sum[0]=0;
for(i=1;i<=c;i++)
{
scanf("%ld%ld",&a[i],&p[i]);
sum[i]=sum[i-1]+a[i];
}
for(i=1;i<=c;i++)
{
f[i]=(sum[i]+10)*p[i];
for(j=1;j<i;j++)
f[i]=min(f[i],(sum[i]-sum[j]+10)*p[i]+f[j]);
}
printf("%ld\n",f[c]);
}
return 0;
}