背包解法
//====================================================================||
// ||
// ||
// 作者：GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
double each;
int n;
double sell\[100\];
int sellnum\[100\];
int q\[20000\];
int qnum;
double dp\[210\];
void solve(){
fill(&dp\[0\],&dp\[209\],oo);
dp\[0\]=0;
for(int i=0;i<n;i++){
for(int j=sellnum\[i\];j<=209;j++){
dp\[j\]=min(dp\[j\],dp\[j-sellnum\[i\]\]+sell\[i\]);
}
}
// for(int i=0;i<210;i++)printf("%.2f\n",dp\[i\]);
for(int i=0;i<qnum;i++){
double ans=dp\[q\[i\]\];
for(int j=q\[i\];j<202;j++){
ans=min(ans,dp\[j\]);
}
printf("购买 %d 价格为 $%.2f\n",q\[i\],ans);
}
}
int main() {
ios\_base::sync\_with\_stdio(0);
int ff=0;
while(~scanf("%lf%d",&each,&n)){
sellnum\[n\]=1;
sell\[n\]=each;
for(int i=0;i<n;i++){
scanf("%d%lf%\*c",&sellnum\[i\],&sell\[i\]);
}
n++;
qnum=0;
for(;;){
scanf("%d",&q\[qnum++\]);
if(getchar()=='\n')break;
}
printf("案例 %d:\n",++ff);
solve();
}
}