记录编号	306737	评测结果	AAAAAAAAAA
题目名称	[NOIP 2012]国王游戏	最终得分	100
用户昵称	KZNS	是否通过	通过
代码语言	C++	运行时间	0.204 s
提交时间	2016-09-13 00:10:04	内存使用	0.30 MiB

//KZNS
#include <cstdio>
#include <algorithm>
#include <utility>
#include <cstring>
using namespace std;
#define Nmax 1006
typedef long long LL;
typedef pair<int, int> pr;
inline bool cmp(const pr a, const pr b) {
	return a.first * a.second < b.first * b.second;
}
class HA {//Hign Accuracy
public:
	int d[2000];
	void a0() {
		memset(d, 0, sizeof(d));
	}
	void b0() {
		memset(d, 0, sizeof(d));
		d[0] = 1;
	}
	void carry() {
		for (int i = 0; i <= 1998; i++) {
			d[i+1] += d[i] / 10000;
			d[i] %= 10000;
		}
	}
	void output() {
		int i = 1999;
		while (!d[i]) i--;
		printf("%d", d[i]);
		for (i--; i >= 0; i--)
			printf("%.4d", d[i]);
	}
};
inline void operator += (HA &a, const int b) {
	a.d[0] += b;
	a.carry();
}
inline void operator *= (HA &a, const int b) {
	for (int i = 0; i < 2000; i++)
		a.d[i] *= b;
	a.carry();
}
inline bool operator < (const HA &a, const HA &b) {
	for (int i = 1999; i >= 0; i--)
		if (a.d[i] == b.d[i])
			continue;
		else
			if (a.d[i] < b.d[i])
				return true;
			else
				return false;
	return false;
}
inline HA operator / (HA a, const int b) {
	int u = 0;
	for (int i = 1999; i >= 0; i--) {
		a.d[i] += u*10000;
		u = a.d[i] % b;
		a.d[i] /= b;
	}
	return a;
}
pair<int, int> ls[Nmax];
int N;
int main() {
	freopen("kinggame.in", "r", stdin);
	freopen("kinggame.out", "w", stdout);
	scanf("%d", &N);
	for (int i = 0; i <= N; i++)
		scanf("%d %d", &ls[i].first, &ls[i].second);
	sort(ls+1, ls+N+1, cmp);
	HA sm, ans;
	sm.a0();
	ans.a0();
	sm += ls[0].first;
	for (int i = 1; i <= N; i++) {
		ans = max(ans, sm / ls[i].second);
		sm *= ls[i].first;
	}
	ans.output();
	return 0;
}
//UBWH