> For the complete documentation index, see [llms.txt](https://851958789.gitbook.io/notes/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://851958789.gitbook.io/notes/0321_create_maximum_number/slt.md).

# 思路1

利用分治的思想。

* 求单个数组中给定个数能取得的最大数
* 把多个单个数组的结果merge起来

时间复杂度

merge是O(k) pick是O(m+n) 加上外层的遍历 从时间是O(k^2 \* (m+n))

空间复杂度O(max(m,n,k))