114. 国王游戏【高精度+贪心】

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
const int N=1e5+10;
bool cmp(PII a,PII b)
{
    return a.first*a.second<b.first*b.second;
}
vector<PII>ve;
vector<int> mul(vector<int>& A,int b)
{
    int t=0;
    vector<int> C;
    for(int i=0;i<A.size()||t;i++)
    {
        if(i<A.size()) t+=A[i]*b;
        C.push_back(t%10);
        t/=10;
    }
    while(C.size()>1&&C.back()==0) C.pop_back();
    return C;
}
vector<int> div(vector<int> &A,int b)
{
    int res=0;
    vector<int>C;
    for(int i=A.size()-1;i>=0;i--)
    {
        res=res*10+A[i];
        C.push_back(res/b);
        res=res%b;
    }
    reverse(C.begin(),C.end());
    while(C.size()>1&&C.back()==0) C.pop_back();
    return C;
}
vector<int> maxv(vector<int> A,vector<int> B)
{
    if(A.size()>B.size()) return A;
    if(A.size()<B.size()) return B;
    for(int i=A.size()-1;i>=0;i--)
    {
        if(A[i]>B[i]) return A;
        if(A[i]<B[i]) return B;
    }
    return A;
}
int main(void)
{
    int n; cin>>n;
    for(int i=0;i<=n;i++)
    {
        int a,b; cin>>a>>b;
        ve.push_back({a,b});
    }
    sort(ve.begin()+1,ve.end(),cmp);
    vector<int>ans,a; 
    ans.push_back(0),a.push_back(1);
    for(int i=1;i<=n;i++)
    {
        a=mul(a,ve[i-1].first);
        auto temp=div(a,ve[i].second);
        ans=maxv(ans,temp);
    }
    for(int i=ans.size()-1;i>=0;i--) cout<<ans[i];
    return 0;
}