use strict;
use warnings;

use Heap::Simple::Perl;

my %hash;
$hash{$_} = int( rand( 1000 ) ) for 'AA' .. 'FF';

my $find_n = 10;

my $heap = heapify( \%hash );

my $top = get_top_n( $heap, $find_n );

foreach my $element ( @{$top} ) {
    print "$element->[0]\t=>$element->[1]\n";
}


sub heapify {
    my( $href ) = $_[0];
    my $heap = Heap::Simple::Perl->new( 
        'order'     => '>',
        'elements'  => ['Array']
    );
    $heap->insert( [ $href->{$_}, $_ ] ) foreach keys %{$href};
    return $heap;
}

sub get_top_n {
    my( $heap, $n ) = @_;
    my $top_n ;
    for( 1 .. $n ) {
        my( $value, $key ) = @{ $heap->extract_top() };
        push @{ $top_n }, [ $key, $value ];
    }
    return $top_n;
}