流程图求解代码staticclassMinister{longa;longb;Minister(longa,longb){this.aa;this.bb;}}publicstaticvoidmain(String[]args)throwsIOException{BufferedReaderbrnewBufferedReader(newInputStreamReader(System.in));PrintWriteroutnewPrintWriter(newOutputStreamWriter(System.out));intnInteger.parseInt(br.readLine().trim());String[]strbr.readLine().trim().split(\\s);longa0Long.parseLong(str[0]);Minister[]ministersnewMinister[n];for(inti0;in;i){String[]ministerStrbr.readLine().trim().split(\\s);longaLong.parseLong(ministerStr[0]);longbLong.parseLong(ministerStr[1]);ministers[i]newMinister(a,b);}Arrays.sort(ministers,(x,y)-Long.compare(x.a*x.b,y.a*y.b));// 计算最大金币数longmaxCoin0;longproductAa0;// 前序左手数的乘积初始为国王的a0for(Ministerm:ministers){// 当前大臣的金币数 前序乘积 / 当前blongcoinproductA/m.b;// 更新最大金币数if(coinmaxCoin){maxCoincoin;}// 前序乘积 * 当前大臣的aproductA*m.a;}out.println(maxCoin);out.flush();out.close();br.close();}