【ACM模式】序列操作

求解代码

importjava.io.BufferedReader;importjava.io.IOException;importjava.io.InputStreamReader;importjava.io.OutputStreamWriter;importjava.io.PrintWriter;importjava.io.StreamTokenizer;importjava.util.ArrayList;importjava.util.Collections;importjava.util.List;publicclassBISHI1{publicstaticintq;publicstaticvoidmain(String[]args)throwsIOException{BufferedReaderbr=newBufferedReader(newInputStreamReader(System.in));StreamTokenizerin=newStreamTokenizer(br);PrintWriterout=newPrintWriter(newOutputStreamWriter(System.out));List<Integer>list=newArrayList<>();while(in.nextToken()!=StreamTokenizer.TT_EOF){q=(int)in.nval;for(inti=0;i<q;i++){in.nextToken();inta=(int)in.nval;switch(a){case1:in.nextToken();list.add((int)in.nval);break;case2:list.remove(list.size()-1);break;case3:in.nextToken();out.println(list.get((int)in.nval));break;case4:in.nextToken();intii=(int)in.nval;in.nextToken();intiii=(int)in.nval;list.add(ii+1,iii);break;case5:Collections.sort(list);break;case6:Collections.sort(list,(o1,o2)->(o2-o1));break;case7:out.println(list.size());break;case8:list.forEach(y->out.print(y+" "));out.println();break;default:break;}}}out.flush();out.close();}}