题目大意:有n类物品,第i类物品有mi件可选物品,每件物品都有品质b和价格p两种属性,让你从n类商品中每一类选择一件,使得最后的得分最高,得分定义为min(b)/sum(p),即品质的最低值除以价格之和。
思路:贪心思路,枚举所有可能的属性,然后在每类商品中选择大于等于该属性且价格最低的。然后从所有枚举的答案中选择值最大的。具体操作为将每类商品按价格从低到高进行排序,这样可以顺序检测。
代码:
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <climits>
#include <cstdio>
using namespace std;
struct Device
{
int price,bandwidth;
}tmp;
bool compare(struct Device a,struct Device b)
{
return a.price<b.price;
}
int main()
{
int test_cases,n,m,i,j,k;
int cnt,sum_price,min_bandwidth;
double ans;
vector<struct Device> device[105];
vector<int> bandwidth;
set<int> st;
scanf("%d",&test_cases);
while (test_cases--)
{
scanf("%d",&n);
bandwidth.clear();
st.clear();
for (i=1;i<=n;i++)
{
device[i].clear();
scanf("%d",&m);
for (j=1;j<=m;j++)
{
scanf("%d%d",&tmp.bandwidth,&tmp.price);
device[i].push_back(tmp);
if (st.find(tmp.bandwidth)==st.end())
{
st.insert(tmp.bandwidth);
bandwidth.push_back(tmp.bandwidth);
}
}
sort(device[i].begin(),device[i].end(),compare);
}
sort(bandwidth.begin(),bandwidth.end());
for (i=0,ans=0.0;i<bandwidth.size();i++)
{
min_bandwidth=bandwidth[i];
sum_price=0;
cnt=0;
for (j=1;j<=n;j++)
{
for (k=0;k<device[j].size();k++)
if (device[j][k].bandwidth>=min_bandwidth)
{
sum_price+=device[j][k].price;
cnt++;
break;
}
if (cnt!=j)
break;
}
if (cnt==n && (double)min_bandwidth/sum_price>ans)
ans=(double)min_bandwidth/sum_price;
}
printf("%.3lf\n",ans);
}
return 0;
}