二分求最大满足条件的quality
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
using namespace std;
typedef long long LL;
const int maxn = 1010;
int id,n,m,b;
map<string,int> vis;
int ID(char* str){
string s(str);
if(vis.count(s)) return vis[s];
return vis[s] = id++;
}
struct node{
int price,quality;
node(int x=0,int y=0):price(x),quality(y){}
};
vector&......
阅读全文