uvalive3971（二分＋贪心）

题目的意思是 ,你要去买一台电脑,然后有很多种零件,你每种零件买一个 ,零件给出的的信息有种类,名字,价格,质量.

你组装的电脑的质量,取决于你的零件中质量最差的,也就是你要让最差值尽量大,但是价格不能超出你的budget,也就是你有的钱.

把零件按质量从大到小排,然后从大到小判断这个质量能不能作为最小值.知道找到一个质量满足所有零件质量大于等于它,并且没有超出金额;

有参考了一下别人的代码;

ac代码:

#include <stdio.h>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int N = 1005;
const int INF = 0x3f3f3f3f;

struct P {
	string type;
	int m, q;
}p[N];
int num[N], t, n, money, p1[N], temp1, k, minn, sum;

int cmp(P a, P b) {
	return a.type > b.type;
}

int cmp1(int a, int b) {
	return a > b;
}

int solve() {
	int count = 0;
	for (int i = 0; i < n; i += num[count - 1]) {
		minn = INF;
		for (int j = i; j < i + num[count]; j++) {
			if (p[j].q >= temp1 && minn > p[j].m) {
				minn = p[j].m;
			}
		}
		count++;
		if (minn == INF)
			return -1;
		sum += minn;
	}
	if (sum <= money)
		return temp1;
	return -1;
}

int main(){
	string temp;
	scanf("%d", &t);
	while (t--) {
		scanf("%d%d", &n, &money);
		for (int i = 0; i < n; i++) {
			cin >> p[i].type >> temp >> p[i].m >> p[i].q;
			p1[i] = p[i].q;
		}
		sort(p, p + n, cmp);
		sort(p1, p1 + n, cmp1);
		k = 0;
		num[k] = 1;
		temp = p[0].type;
		for (int i = 1; i < n; i++) {
			if (p[i].type == temp) {
				num[k]++;
			}
			else {
				k++;
				temp = p[i].type;
				num[k] = 1;
			}	
		}
		k++;
		temp1 = p1[0];
		sum = 0;
		int ans = solve();
		if (ans != -1) {
			printf("%d\n", ans);
			continue;
		}
		for (int q = 1; q < n; q++) {
			if (temp1 != p1[q]) {
				temp1 = p1[q];
				sum = 0;
				ans = solve();
				if (ans != -1) {
					printf("%d\n", ans);
					break;
				}
			}
		}
	}
	return 0;
}