diff --git a/src/cote/README.md b/src/cote/README.md index 67775c43..18b1f096 100644 --- a/src/cote/README.md +++ b/src/cote/README.md @@ -4,4 +4,4 @@ |1|[그리디](./greedy/)|[거스름돈](./greedy/greedy_ex.js)
[큰 수의 법칙](./greedy/greedy_01.js)
[숫자 카드 게임](./greedy/greedy_02.js)
[1이 될 때까지](./greedy/greedy_03.js)
-
[모험가 길드](./greedy/test_01.js)
[곱하기 혹은 더하기](./greedy/test_02.js)
[문자열 뒤집기](./greedy/test_03.js)
|22.07.14



-
22.07.16


|O
X
O
O
-
O
O
O
|X
[22.07.16](./greedy/replay_01.js)
X
X
-
O
X
X
| |2|[구현](./implementation/)|[상하좌우](./implementation/imple_ex01.js)
[시각](./implementation/imple_ex02.js)
[왕실의 나이트](./implementation/imple_01.js)
[게임 개발](./implementation/imple_02.js)
-
[럭키 스트레이트](./implementation/test_01.js)
[문자열 재정렬](./implementation/test_02.js)
|22.07.15



-
22.07.20
22.07.23
|△


X
-
O
O|[22.07.17](./implementation/../replay_01.js)
[22.07.18](./implementation/replay_02.js)
[22.07.19](./implementation//replay_03.js)
[22.07.19](./implementation/replay_04.js)
-
X
X| |3|[DFS, BFS](./dfs%2Cbfs/)|[DFS 예제](./dfs%2Cbfs/dfs_ex.js)
[BFS 예제](./dfs%2Cbfs/dfs_ex.js)
[음료수 얼려 먹기](./dfs%2Cbfs/dfs%2Cbfs_01.js)
[미로 탈출](./dfs%2Cbfs/dfs%2Cbfs_02.js)
-
응|22.07.15

22.07.21
22.07.22
-
응|O
O
X
X
-
응|O
O
O
O
-
ㅇ| -|4|[정렬](./sort/)|[위에서 아래로](./sort/sort_ex_01.js)
[성적이 낮은 순서로 학생 출력하기](./sort/sort_ex_02.js)
|22.07.22
22.07.24
|O
O
|X
X
| \ No newline at end of file +|4|[정렬](./sort/)|[위에서 아래로](./sort/sort_ex_01.js)
[성적이 낮은 순서로 학생 출력하기](./sort/sort_ex_02.js)
[두 배열의 원소 교체](./sort/sort_ex_03.js)|22.07.22
22.07.24

|O
O
O
|X
X
X
| \ No newline at end of file diff --git a/src/cote/sort/sort_ex_03.js b/src/cote/sort/sort_ex_03.js new file mode 100644 index 00000000..5909f001 --- /dev/null +++ b/src/cote/sort/sort_ex_03.js @@ -0,0 +1,15 @@ +'use strict'; + +function solution(N, K, s) { + const arr = s.split('\n').map((v) => v.split(' ')); + const A = arr[0].map((v) => +v).sort((a,b) => a-b); + const B = arr[1].map((v) => +v).sort((a,b) => b-a); + + console.log(A, B); + for(let i = 0; i < K; i++) { + [[A[i]], B[i]] = [[B[i]], A[i]]; + } + return A.reduce((acc, value) => acc += value, 0); +} + +console.log(solution(5, 3, '1 2 5 4 3\n5 5 6 6 5')); \ No newline at end of file