求条

$\Huge{\color{orange} 救命}$ <——戳这里

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