1
const maxNumber = (a, b, k) => {5
for (let i = Math.max(0, k - n); i <= Math.min(k, m); i++) {6
let maxA = maxArray(a, i),7
maxB = maxArray(b, k - i);8
let merge = mergeArray(maxA, maxB);9
if (merge > res) res = merge;14
const maxArray = (a, k) => {15
let drop = a.length - k,18
while (drop > 0 && res.length && res[res.length - 1] < x) {24
if (res.length >= k) {25
res = res.slice(0, k);27
res = res.concat(Array(k - res.length).fill(0));32
const mergeArray = (a, b) => {34
while (a.length + b.length) res.push(a > b ? a.shift() : b.shift());