POJ 2010 Moo University - Financial Aid

学习了这位聚聚的二分做法，感觉好棒嗷嗷嗷！http://www.cnblogs.com/Thispoet/archive/2011/11/28/2266853.html

思路：
二分是中位数最大，要解决的就是w的值如何处理，他并不单调。关键就在于check函数。
在取中位数两边的数时，贪心选取w小的，根据左右满足条件的个数来缩小二分范围。
日后再补上优先队列的做法。

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define LL long long
#define maxn 100005
#define maxm 1000005
#define mod  1000000007
#define INF 1000000007
#define EPS 1e-6
#define N 100005
using namespace std;
//-------------------------CHC------------------------------//
struct Node {
	int v, w, id;
}nodev[maxn], nodew[maxn];
int n, c, f;

bool cmpv(Node &a, Node &b) { return a.v < b.v; }
bool cmpw(Node &a, Node &b) { return a.w < b.w; }

int check(int mid) {
	int l = 0, r = 0, sum = nodev[mid].w;
	for (int i = 0; i < n; ++i) {
		if (nodew[i].id < mid && sum + nodew[i].w <= f && l < c) sum += nodew[i].w, ++l;
		else if (nodew[i].id > mid && sum + nodew[i].w <= f && r < c) sum += nodew[i].w, ++r;
	}
	if (l < c && r < c) return -1;
	if (r < c) return 1;
	if (l < c) return 2;
	return 0;
}

int main() {
	scanf("%d%d%d", &c, &n, &f);
	c >>= 1;
	for (int i = 0; i < n; ++i) scanf("%d%d", &nodev[i].v, &nodev[i].w);
	sort(nodev, nodev + n, cmpv);
	for (int i = 0; i < n; ++i) nodev[i].id = i;
	memcpy(nodew, nodev, sizeof(nodev));
	sort(nodew, nodew + n, cmpw);
	int l = 0, r = n, ans = -1;
	while (r - l > 1) {
		int mid = (l + r) >> 1;
		int ret = check(mid);
		if (ret == -1) break;
		if (ret == 0) {
			if (ans < mid) ans = mid;
			l = mid;
		}
		if (ret == 1) r = mid;
		if (ret == 2) l = mid;
	}
	if (ans != -1) printf("%d\n", nodev[ans].v);
	else printf("-1\n");
	return 0;
}