#!/usr/bin/perl
# sortiranje tako da uvijek u listi postoje samo najvece vrijednosti
# za zadani kljuc
# (c) Dinko Korunic, 2004

my $visit=();

while (<>)
{
  chop();

  if (/\s*(.+)\s+(\d+)\s+(\d+)/)
  {
    if (($visit{"$1"}[0] < $2) || ($visit{"$1"}[1] < $3))
    {
      $visit{"$1"}[0]=$2;
      $visit{"$1"}[1]=$3;
    }
  }
}
foreach(sort { $hash{$b} <=> $hash{$a}
|| length($b) <=> length($a) || $a cmp $b } keys %visit)
{
  print "$_ $visit{$_}[0] $visit{$_}[1]\n";
}