zoj 2109 FatMouse' Trade【水】
2011-11-11 01:46
295 查看
wa了好几次,网上查了一下说是不能对float sort排序...
#include <stdio.h>
#include <algorithm>
using namespace std;
struct room
{
int j, f;
//float ave;//去掉
}r[1001];
int cmp(struct room a, struct room b)
{
return a.j * b.f > a.f * b.j;//改成-号竟然段错误,太神奇了
//原来是return a.ave - b.ave;
}
int main()
{
int m, n, i;
double ans;
while(scanf("%d%d", &m, &n) && m != -1 && n != -1)
{
ans = 0;
for(i=0; i<n; i++)
{
scanf("%d%d", &r[i].j, &r[i].f);
}
sort(r, r+n, cmp);
i = 0;
while(m && i < n)
{
if(m >= r[i].f)
{
ans += r[i].j;
m -= r[i].f;
}
else
{
ans += r[i].j * 1.0 / r[i].f * m;
m = 0;
}
i++;
}
printf("%.3lf\n", ans);
}
return 0;
}
#include <stdio.h>
#include <algorithm>
using namespace std;
struct room
{
int j, f;
//float ave;//去掉
}r[1001];
int cmp(struct room a, struct room b)
{
return a.j * b.f > a.f * b.j;//改成-号竟然段错误,太神奇了
//原来是return a.ave - b.ave;
}
int main()
{
int m, n, i;
double ans;
while(scanf("%d%d", &m, &n) && m != -1 && n != -1)
{
ans = 0;
for(i=0; i<n; i++)
{
scanf("%d%d", &r[i].j, &r[i].f);
}
sort(r, r+n, cmp);
i = 0;
while(m && i < n)
{
if(m >= r[i].f)
{
ans += r[i].j;
m -= r[i].f;
}
else
{
ans += r[i].j * 1.0 / r[i].f * m;
m = 0;
}
i++;
}
printf("%.3lf\n", ans);
}
return 0;
}
相关文章推荐
- ZOJ 2109 FatMouse' Trade (背包 dp + 贪心)
- zoj 2109 FatMouse' Trade 部分背包
- zoj 2109 FatMouse' Trade
- zoj 2109 FatMouse' Trade 贪心
- ZOJ 2109 FatMouse' Trade
- zoj 2109 FatMouse' Trade
- ZOJ 2109 FatMouse' Trade
- ZOJ 2109 FatMouse' Trade (背包 dp + 贪婪)
- ZOJ-2109FatMouse' Trade
- zoj 2109 FatMouse' Trade简单的贪心 (注意double数组的排序问题)
- ZOJ 2109 FatMouse' Trade
- zoj 2109 || hdoj1009 FatMouse' Trade(贪心)
- zoj 2109.FatMouse' Trade
- ZOJ 2109 FatMouse' Trade
- zoj 2109 FatMouse' Trade (纯水背包问题~贪心❤)
- ZOJ Problem Set - 2109 FatMouse' Trade
- zoj 2109 FatMouse' Trade
- ZOJ Problem Set - 2109 FatMouse' Trade
- hdu-1009-贪心-FatMouse' Trade
- HDU 1009 - FatMouse' Trade(贪心)