???
采药搞得这么复杂干嘛？
```cpp
#include<bits/stdc++.h>
using namespace std;
int dp[101][10001],m,n,w[101],v[101];
int main(){
cin>>m>>n;
for(int i=1;i<=n;i++){
cin>>w[i]>>v[i];
}
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(j<w[i]) dp[i][j]=dp[i-1][j];
else dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v[i]);
}
}
cout<<dp[n][m];
return 0;
}
```
by Walker_Sama @ 2022-07-07 11:06:57
@[Toby_Fox](/user/591668) a……
by SZnP @ 2022-07-07 11:09:35
```cpp
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
struct YAO{
int time,jiazhi;
};
YAO a[100];
int shijian,keshu,f[10000];
int main()
{
cin>>shijian>>keshu;
for(int i=0;i<keshu;i++)
cin>>a[i].time>>a[i].jiazhi;
for(int i=0;i<keshu;i++)
for(int j=shijian;j>=a[i].time;j--)
f[j]=max(f[j],f[j-a[i].time]+a[i].jiazhi);
cout<<f[shijian];
return 0;
}
```
by snail2956 @ 2022-07-07 11:10:39
@[LXLLZG](/user/516867) 把 f[shijian-1] 改为 f[shijian]
by snail2956 @ 2022-07-07 11:12:05
@[snail2956](/user/579234) ！！！
非常感谢OTZ
by SZnP @ 2022-07-07 11:13:21