結果

問題 No.1282 Display Elements
ユーザー watarimaycry2watarimaycry2
提出日時 2020-11-06 22:34:08
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 3,242 bytes
コンパイル時間 6,279 ms
コンパイル使用メモリ 83,244 KB
実行使用メモリ 77,780 KB
最終ジャッジ日時 2024-07-22 13:19:16
合計ジャッジ時間 7,746 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
42,448 KB
testcase_01 AC 54 ms
36,984 KB
testcase_02 AC 58 ms
36,860 KB
testcase_03 AC 55 ms
36,768 KB
testcase_04 AC 54 ms
36,708 KB
testcase_05 AC 55 ms
37,000 KB
testcase_06 AC 54 ms
37,456 KB
testcase_07 AC 54 ms
37,088 KB
testcase_08 AC 55 ms
37,320 KB
testcase_09 AC 56 ms
37,228 KB
testcase_10 AC 88 ms
38,496 KB
testcase_11 AC 81 ms
38,124 KB
testcase_12 AC 60 ms
37,000 KB
testcase_13 AC 105 ms
38,912 KB
testcase_14 AC 129 ms
39,148 KB
testcase_15 TLE -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	static void solve(){//Here is the main function
		int N = nextInt();
		ArrayList<Integer> alist = nextIntArray();
		ArrayList<Integer> blist = nextIntArray();
		int output = 0;
		TreeSet<Integer> set = new TreeSet<>(blist);
		Collections.sort(alist);
		for(int i = N - 1; i >= 0; i--){
			SortedSet<Integer> head = set.headSet(alist.get(i));
			output += head.size();
			if(head.size() == 0){
				break;
			}
			set.remove(blist.get(i));
		}
		myout(output);
	}
	//Method addition frame start



	//Method addition frame end

	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.add(read);
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextStrArray(){return myconv(next(), 8);}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<Integer> nextIntArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Integer.parseInt(input.get(i)));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Long.parseLong(input.get(i)));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof ArrayList){
			return String.join(joinString, (ArrayList)list);
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//Don't have to see. end------------------------------------------
}
0