Node.js)백준 15655번: N과 M (6)

https://www.acmicpc.net/problem/15655

15655번: N과 M (6)

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n").map(v=>v.split(' ').map(Number));
const [N,M] = input[0]
const nums = input[1].sort((a,b)=>a-b)
const answer = [];



for(let i = 0; i<(1<<N); i++){
  if(countBit(i)==M){
    let temp = [];
    for(let j = 0; j<N; j++){
        if((i>>j)&1) temp.push(nums[j])
    }
    answer.push(temp)
  }
}



console.log(answer.sort((a,b)=>{
  let n = 0;
  while(true){
    if(n==M){
      return a[n]-b[n]
    }
    if(a[n]>b[n]){
      return 1;
    }else if(a[n]<b[n]){
      return -1;
    }else{
      n++;
    }
  }
}).map(v=>v.join(' ')).join('\n'))


function countBit(n){
  let cnt = 0;
  while(n>0){
    if(n&1) cnt++;
    n= n>>1;
  }
  return cnt
}