zju2109

最新推荐文章于 2013-12-02 23:02:39 发布

Angela_Aki

最新推荐文章于 2013-12-02 23:02:39 发布

阅读量537

点赞数

分类专栏： ZOJ

本文链接：https://blog.csdn.net/tiantian_zone/article/details/17051083

版权

ZOJ 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
using namespace std;
struct Mouse{
	double J;
	double F;
	double a;
};
bool Comp(const Mouse &s1, const Mouse &s2)
{
	if (s1.a != s2.a)
		return s1.a > s2.a;
	else
		return s1.F < s2.F;
}
int main()
{
	int M, N;
	double sum;
	vector<Mouse> v;
	Mouse mouse;
	while (cin >> M >> N)
	{
		sum = 0.0;
		v.clear();
		if (M == -1 && N == -1)
			break;
		for (int i = 0; i < N; ++i)
		{
			cin >> mouse.J >> mouse.F;
			mouse.a = mouse.J / mouse.F;
			v.push_back(mouse);
		}
		sort(v.begin(), v.end(), Comp);
		for (int i = 0; i < v.size(); ++i)
		{
			if (M > v[i].F)
			{
				sum += v[i].J;
				M = M - v[i].F;
			}
			else
			{
				sum += M * v[i].a;
				break;
			}
		}
		cout << setprecision(3) << setiosflags(ios::fixed) << sum << endl;
	}
	return 0;
}