BISHI53 [P1080] 国王游戏(简化版)

流程图

求解代码

staticclassMinister{longa;longb;Minister(longa,longb){this.a=a;this.b=b;}}publicstaticvoidmain(String[]args)throwsIOException{BufferedReaderbr=newBufferedReader(newInputStreamReader(System.in));PrintWriterout=newPrintWriter(newOutputStreamWriter(System.out));intn=Integer.parseInt(br.readLine().trim());String[]str=br.readLine().trim().split("\\s+");longa0=Long.parseLong(str[0]);Minister[]ministers=newMinister[n];for(inti=0;i<n;i++){String[]ministerStr=br.readLine().trim().split("\\s+");longa=Long.parseLong(ministerStr[0]);longb=Long.parseLong(ministerStr[1]);ministers[i]=newMinister(a,b);}Arrays.sort(ministers,(x,y)->Long.compare(x.a*x.b,y.a*y.b));// 计算最大金币数longmaxCoin=0;longproductA=a0;// 前序左手数的乘积（初始为国王的a0）for(Ministerm:ministers){// 当前大臣的金币数 = 前序乘积 / 当前blongcoin=productA/m.b;// 更新最大金币数if(coin>maxCoin){maxCoin=coin;}// 前序乘积 *= 当前大臣的aproductA*=m.a;}out.println(maxCoin);out.flush();out.close();br.close();}