let s = input[1].split(" ").map((n) => Number(n));
let nums = input[3].split(" ").map((n) => Number(n));
var ans = [];
nums.forEach((n) => {
ans.push(s.filter((num) => n == num).length)
})
console.log(ans.join(" "))
처음에 단순하게 풀었다가 실패
당연함
이분탐색으로 풀어야함
let fs = require('fs');
let input = fs.readFileSync('/dev/stdin').toString().split('\n');
let count = input[0];
let numbers = [];
let s = input[1].split(" ").map((n) => Number(n));
let nums = input[3].split(" ").map((n) => Number(n));
let ans = new Array(nums.length).fill(0);
s.sort((a, b) => a - b);
nums.forEach((n, idx) => {
var left = 0;
var right = s.length - 1;
while(left <= right) {
var mid = Math.floor((left + right) / 2);
if (s[mid] == n) {
ans[idx]++;
break;
}
else if (s[mid] < n) left = mid + 1;
else right = mid - 1;
}
})
console.log(ans.join(" "))
성고옹