Compare Two Lists by Their Maximum Given two different lists of non-negative integers, return the list that has the highest maximum (e.g. [4, 2], [3, 3, 1] -&gt; [4, 2]).
If they both have the same maximum, return the list that contains more instances of this maximum (e.g. [4, 2, 4], [4, 3, 3, 3, 1, 3] -&gt; [4, 2, 4]).
If, after these comparisons, they are equal, do the same comparison but with their next highest item (e.g. [2, 3, 4, 4], [4, 4, 3, 3, 1] -&gt; [4, 4, 3, 3, 1]).
If, after all these comparisons, they are still considered to be equal, output the longer list (e.g. [4, 3, 2, 1, 0], [1, 2, 3, 4] -&gt; [4, 3, 2, 1, 0]).
Make your code as short as possible.
Test Cases
[4, 4, 4, 4, 2, 4], [4, 4, 4, 4, 3, 2] -&gt; [4, 4, 4, 4, 2, 4]
[0], [] -&gt; [0]
[0, 0], [0] -&gt; [0, 0]
[1], [0, 0] -&gt; [1]
[4, 4, 4, 4, 4, 2], [4, 4, 4, 4, 4] -&gt; [4, 4, 4, 4, 4, 2]
[1, 0], [0, 0, 0] -&gt; [1, 0]
Pyth, 4 bytes

eo_S


Try it online

Explanation

eo_S
 o  NQ    Order the inputs...
  _S      ... by their reversed sorted values...
e         ... and take the last.