1 solutions

  • 0
    @ 2025-11-5 15:54:30

    C++ :

    #include <bits/stdc++.h>
    using namespace std;
    
    int n, m;
    int v[30], p[30], f[30009];
    
    int main() {
    	cin >> n >> m;
    	for (int i = 1; i <= m; i ++) cin >> v[i] >> p[i];
    	
    	for (int i = 1; i <= m; i ++) {
    		for (int j = n; j >= v[i]; j --) {
    			f[j] = max(f[j], f[j - v[i]] + v[i] * p[i]);
    		}
    	}
    	cout << f[n];
    
    	return 0;
    }
    
    
    • 1

    Information

    ID
    17313
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By