题目传送门sx
设任意两个相邻的大臣数字为a[i],b[i],a[j],b[j];
推导推导可得出按a*b从小到大排序是最优的;
写高精 恶心
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=10100;
int n,ans[N],sum[N],a0,b0,u[N],c[N],len;
struct st{int a,b,c;}nod[N];
int read(){int s=0,f=1;char c=getchar();while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){s=s*10+c-'0';c=getchar();}return f*s;}
bool cmp(const st &a,const st &b){return a.c<b.c;}
int main()
{
n=read();
a0=read();b0=read();
for(int i=1;i<=n;i++)
nod[i].a=read(),nod[i].b=read(),nod[i].c=nod[i].a*nod[i].b;
sort(nod+1,nod+n+1,cmp);
int t=0;
while(a0){t++;sum[t]=a0%10;a0/=10;}
for(int i=1;i<=n;i++){
int s=0,p=t,v=nod[i].b,w=0;
memset(c,0,sizeof(c));
while(p){
s=s*10+sum[p];
c[++w]=s/v;
if(s>=v){
if(s%v==0)
s=0;
else s-=s/v*v;
}
--p;
}p=1;
while(!c[p]) p++;
if(w-p+1>len){
len=0;
while(w>=p) ans[++len]=c[w],--w;
}
else if(w-p+1==len) {
int j=len,f=0,k=w;
while(j) {if(ans[j]<c[k]) {f=1;break;} --k;}
if(f) for(j=1;j<=len;j++) ans[j]=c[w-j+1];
}
int l=0;
while(nod[i].a){u[++l]=nod[i].a%10;nod[i].a/=10;}
for(int j=1;j<=l+t+500;j++) c[j]=0;
for(int j=1;j<=l;j++){
for(int k=1;k<=t;k++)
c[k+j-1]+=sum[k]*u[j];
}
for(p=1;p<=l+t-1;++p) c[p+1]+=c[p]/10,c[p]%=10;
while(c[p]) c[p+1]+=c[p]/10,c[p]%=10,++p;
t=p-1;
for(int k=1;k<=t;k++)
sum[k]=c[k];
}
for(int i=len;i;i--)
printf("%d",ans[i]);
return 0;
}