#include <iostream>
#include <cmath>
using namespace std;
const int N=1000*46;
#define max(a,b) ((a>b)?(a):(b))
int a[11],b[11],dp[N];
int main()
{
	int t;
	for(scanf("%d",&t);t--;)
	{
		int money,year;
		scanf("%d%d",&money,&year);
		int v=money*pow(1.1,(double)year)/1000;
		int d;
		scanf("%d",&d);
		int i,j;
		for(i=1;i<=d;i++)
			scanf("%d%d",&a[i],&b[i]);
		memset(dp,0,sizeof(dp));
		for(i=1;i<=d;i++)
			for(j=a[i]/1000;j<=v;j++)
				dp[j]=max(dp[j-a[i]/1000]+b[i],dp[j]);
		for(i=1;i<=year;i++)
			money+=dp[money/1000];
		printf("%d\n",money);
	}
	return 0;
}

• Re:我也没优化啊,,,就0ms了,, (22) The_Dawn 2011-03-29 23:28:00