개발야옹

최댓값

내 코드

const fs = require('fs');
let input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');
let N = 0;
let M = 0;
const arr = [];
input.forEach((i) => {
    i = i.split(' ').map(a=>Number(a));
    M = i.length;
    arr.push(...i);
});

const max = Math.max(...arr);
const index = arr.indexOf(max);
console.log(max)
console.log(Math.floor(index/M) +1 , index%M +1);

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

const fs = require('fs');
let input = fs.readFileSync('/dev/stdin').toString().split('\n');

const dic = {};

input.forEach(i => {
    let arr = i.split("").filter(d => d !== ' ');
    arr.forEach((a) => {
        if(dic[a] === undefined) {
            dic[a] =1;
        } else {
            dic[a] +=1;
        }
    })
}) ;

const keys = Object.keys(dic);

let answer = [];

keys.forEach(k => {
   answer.push([k, dic[k]]);
});

answer.sort(function(a,b){
    return b[1] - a[1];
})

const max = answer[0][1];
answer = answer.filter(a => a[1] === max);

const print =[];
answer.forEach(a => {
    print.push(a[0]);
});
print.sort();

console.log(print.join(''));

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

const fs = require('fs');
const input = fs.readFileSync('/dev/stdin').toString().trim();

const arr = input.split("").map(i =>  Number(i));

arr.sort(function(a,b) {
    return b - a;
});

console.log(arr.join(""));

좌표 정렬하기

내 코드

const fs = require('fs');
const input = fs.readFileSync('/dev/stdin').toString().trim().split("\n");

const N = Number(input.shift());
const dic = [];

for(let i = 0 ;i < N ; i++) {
    const [x,y] = input[i].split(" ").map(i => Number(i));
    dic.push([x,y]);
}

dic.sort(function(a,b) {
    if(a[0] < b[0]) return -1;
    else if(a[0] > b[0]) return 1;
    else {
        if(a[1] < b[1]) return -1;
        else if(a[1] > b[1]) return 1;
        else {
            return 0;
        }
    }
})

const answer = [];
dic.forEach((d) => {
    answer.push(d[0]+' '+d[1]);
})

console.log(answer.join('\n'));