結果

問題 No.1380 Borderline
ユーザー watarimaycry2watarimaycry2
提出日時 2021-02-09 00:24:41
言語 JavaScript
(node v21.7.1)
結果
AC  
実行時間 159 ms / 2,000 ms
コード長 2,577 bytes
コンパイル時間 281 ms
コンパイル使用メモリ 5,308 KB
実行使用メモリ 46,336 KB
最終ジャッジ日時 2023-09-20 09:12:00
合計ジャッジ時間 8,993 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 91 ms
42,608 KB
testcase_01 AC 91 ms
42,516 KB
testcase_02 AC 91 ms
42,512 KB
testcase_03 AC 89 ms
42,692 KB
testcase_04 AC 91 ms
42,760 KB
testcase_05 AC 90 ms
42,476 KB
testcase_06 AC 90 ms
42,624 KB
testcase_07 AC 91 ms
42,480 KB
testcase_08 AC 91 ms
42,480 KB
testcase_09 AC 91 ms
42,552 KB
testcase_10 AC 92 ms
44,516 KB
testcase_11 AC 90 ms
42,684 KB
testcase_12 AC 96 ms
42,764 KB
testcase_13 AC 91 ms
42,560 KB
testcase_14 AC 159 ms
46,264 KB
testcase_15 AC 102 ms
46,244 KB
testcase_16 AC 101 ms
46,084 KB
testcase_17 AC 102 ms
46,260 KB
testcase_18 AC 99 ms
46,336 KB
testcase_19 AC 97 ms
45,960 KB
testcase_20 AC 100 ms
46,096 KB
testcase_21 AC 99 ms
46,260 KB
testcase_22 AC 96 ms
46,324 KB
testcase_23 AC 101 ms
46,148 KB
testcase_24 AC 99 ms
46,156 KB
testcase_25 AC 97 ms
46,280 KB
testcase_26 AC 98 ms
46,252 KB
testcase_27 AC 97 ms
46,160 KB
testcase_28 AC 106 ms
46,088 KB
testcase_29 AC 100 ms
46,168 KB
testcase_30 AC 99 ms
45,904 KB
testcase_31 AC 102 ms
46,116 KB
testcase_32 AC 97 ms
46,088 KB
testcase_33 AC 103 ms
46,308 KB
testcase_34 AC 102 ms
46,156 KB
testcase_35 AC 102 ms
46,240 KB
testcase_36 AC 103 ms
46,320 KB
testcase_37 AC 99 ms
46,144 KB
testcase_38 AC 98 ms
45,912 KB
testcase_39 AC 104 ms
46,156 KB
testcase_40 AC 100 ms
46,164 KB
testcase_41 AC 104 ms
46,200 KB
testcase_42 AC 103 ms
46,272 KB
testcase_43 AC 103 ms
46,252 KB
testcase_44 AC 92 ms
42,748 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//Don't have to see. start------------------------------------------
var read = require('readline').createInterface({
	input: process.stdin, output: process.stdout
});
var obj; var inLine = []; var outputList = [];var retcode = new Set();
read.on('line', function(input){
	var tmp = input.split(' ');
	for(var i = 0; i < tmp.length; i++){
		inLine.push(tmp[i]);
		if(i == tmp.length - 1){
			retcode.add(inLine.length);
		}
	}
});
read.on('close', function(){
	obj = init(inLine);
	console.error('\n↑入力 ↓出力');
	Main();
	console.log(myconv(outputList, 9));
});
function makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}
function nextArray(size, code){
	var ret = new Array(size);
	for(var i = 0; i < size; i++){
		if(code == 'int'){
			ret[i] = nextInt();
		}else{
			ret[i] = next();
		}
	}
	return ret;
}
function nextIntArray(size){return nextArray(size, 'int');} function nextStrArray(size){return nextArray(size, 'str');}
function nextCharArray(){return myconv(next(),6);}
function next(){return obj.next();} function hasNext(){return obj.hasNext();} function nextInt(){return myconv(next(),1);}
function init(input){  
	return {
		list : input, index : 0, max : input.length,
		hasNext : function(){return (this.index < this.max);},
		next : function(){if(this.hasNext()){return this.list[this.index++];}else{throw 'ArrayIndexOutOfBoundsException ‚There is no more input';}},
		isReturn : function(){return retcode.has(this.index);}
	};
}
function myout(s){outputList.push(s);}
function myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}
function isReturn(){return obj.isReturn();}
//param "no" is
//unknown or outlier : return i. 1: parseInt.
//2: split space. 4: split space and parseInt.
//6: split 1 character. 7: split 1 character and parseInt.
//8: join space. 9: join nextline. 0: join no character.
function myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(' ');case 4:return i.split(' ').map(Number);case 6:return i.split('');case 7:return i.split('').map(Number);case 8:return i.join(' ');case 9:return i.join('\n');case 0:return i.join('');default:return i;}}catch(e){return i;}}

//Don't have to see. end------------------------------------------
function Main(){
	var N = nextInt();
	var K = nextInt();
	var list = nextIntArray(N);
	var max = 0;
	for(var i = 0; i <= 400; i++){
		var count = 0;
		for(var j = 0; j < N; j++){
			if(list[j] >= i){
				count++;
			}
		}
		if(count <= K){
			max = Math.max(max, count);
		}
	}
	myout(max);
}
0