poj1260 Pearls

#include<iostream>
#include<cstdio>
using namespace std;
int f[105],sum[105];
int a[105],p[105];
int main(){
	int t,c;
	int i,j;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&c);
		sum[0]=0;
		for(i=1;i<=c;i++){
			scanf("%d%d",&a[i],&p[i]);
			sum[i]=sum[i-1]+a[i];
		}
		f[0]=0;
		for(i=1;i<=c;i++){
			f[i]=(a[i]+10)*p[i]+f[i-1];
			for(j=0;j<i;j++)
				f[i]=min(f[i],f[j]+(sum[i]-sum[j]+10)*p[i]);
		}
		printf("%d\n",f[c]);
	}
	return 0;
}