P2370 yyy2015c01 的 U 盘(二分+dp）

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000005;
const int INF = 0x3f3f3f3f;
#define reg register
#define IOS ios::sync_with_stdio(false)


int n, p, S;
int W[MAXN];
int V[MAXN];
int dp[MAXN];
int tmp;

bool judge(int mid) {
	memset(dp, 0, sizeof(dp));
	for (int i = 1; i <= n; i++) {
		if (W[i] > mid) {
			continue;
		}
		for (int j = S; j >= W[i]; j--) {
			dp[j] = max(dp[j], dp[j - W[i]] + V[i]);
		}
	}
	return dp[S] >= p;
}


int solve(int l, int r) {
	int mid;
	while (r - l > 1) {
		mid = (r + l) >> 1;
		if (judge(mid)) {
			r = mid;
		} else {
			l = mid;
		}
	}
	return r;
}


int main() {
	scanf("%d %d %d", &n, &p, &S);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d", W + i, V + i);
	}
	int ans = solve(1, S + 55);
	if (ans > S) {
		printf("No Solution!");
	} else {
		printf("%d", ans);
	}
	return 0;
}