function solution(k, score) {
let rank = [Math.max(score[0], score[1]), Math.min(score[0], score[1])];
let answer = [score[0], Math.min(score[0], score[1])];
for(var i=2; i<score.length; i++){
if(score[i] > rank[rank.length-1] || rank.length < k){
rank.push(score[i]);
rank.sort((a,b) => b-a);
if(rank.length > k){
rank.pop();
}
}
answer.push(rank[rank.length-1]);
}
return answer;
}