접근 : 구현
Javascirpt
let input = require("fs")
.readFileSync("input.txt") //"/dev/stdin"
.toString()
.split("\n")
.map((val) => val.trim());
function solution(input) {
let [n, k] = input
.shift()
.split(" ")
.map((v) => +v);
let country = [];
let rank = 1;
for (let i = 0; i < n; i++) {
let temp = input
.shift()
.split(" ")
.map((v) => +v);
country.push(temp);
}
country.sort((a, b) => a[0] - b[0]);
rank += country.filter(
(v) =>
v[1] > country[k - 1][1] ||
(v[1] === country[k - 1][1] && v[2] > country[k - 1][2]) ||
(v[1] === country[k - 1][1] && v[2] === country[k - 1][2] && v[3] > country[k - 1][3])
).length;
console.log(rank);
}
solution(input);
'코딩테스트(알고리즘) > baekjoon' 카테고리의 다른 글
[baekjoon] 18111 마인크래프트 (Javascript) (0) | 2022.06.23 |
---|---|
[baekjoon] 2563 색종이 (Javascript) (0) | 2022.06.22 |
[baekjoon] 도로와 신호등 2980 (Javascript) (0) | 2022.06.20 |
[baekjoon] 개미 3048 (Javascript) (0) | 2022.06.20 |
[baekjoon] 쇠막대기 10799 (Javascript,c++) (0) | 2022.06.18 |