Ranking by nn

S=[:]
System.in.eachLine{v=0.decode(it-~/.* /)
S[k=it-v]<v&&(S[k]=v)}
v=i=j=1
S.keySet().sort([compare:{x,y->v=S[x];u=S[y];c=x[0];v<u?1:v>u?-1:c-'L'?c-'A'?c-'F'?0:y[0]-'L'?-1:1:1:-1}]as Comparator).any{u=S[it]
j=v-u?i:j
v=u
i++
println"$j $it$u"}

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page