信奥see you again! I like you, but just like you.

#include<bits/stdc++.h>
using namespace std;
int w[210],c[210];
int n,m;
int dp[210];
int main(){
	cin>>m>>n;
	for(int i=1;i<=n;i++)
		cin>>w[i]>>c[i];
		
	for(int i=1;i<=n;i++){
		for(int j=m;j>0;j--	){
			if(j>=w[i]){
				dp[j]=max(dp[j],dp[j-w[i]]+c[i]);
			}
		}
	}																				
	cout<<dp[m];
	return 0;
	
}

#include<bits/stdc++.h>
using namespace std;
int w[210],c[210];
int n,m;
int dp[210][210];
int main(){
	cin>>m>>n;
	for(int i=1;i<=n;i++)
		cin>>w[i]>>c[i];
		
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			dp[i][j]=dp[i-1][j];
			if(j>=w[i]){
				dp[i][j]=max(dp[i][j],dp[i-1][j-w[i]]+c[i]);
				
			}
		}
	}	
	
	cout<<dp[n][m];
	return 0;
	
}