We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
I just use push and sort, and the complexity is O((n+m)log(n+m)), you can solve it with O(n+m)!
push
sort