Hello Monks!

I have been having trouble getting the sorting of a multi-level hash to do what I want.

#!/usr/bin/perl
use strict;
use warnings;

my $VAR1 = {
          '212' => {
                     '42' => 6,
                     '49' => 6,
                     '41' => 1
                   },
          '282' => {
                     '38' => 4,
                     '39' => 1,
                     '37' => 2
                   }
        };

my %reg = %{$VAR1};
my $c = 1;
# sort by the item with the most sub-keys first
# if there is a tie sort by sub-keys 
foreach my $item (sort { scalar keys (%{$reg{$b}})<=>scalar keys (%{$r
+eg{$a}}) 
                                  ||
                                $a<=>$b   } keys %reg){               
+                     
    foreach my $case (sort {$reg{$item}{$a}<=>$reg{$item}{$b}} keys %{
+$reg{$item}}){
        print "$c = $item:$case\n";
        $c++;
    }
}
[download]

I would like to sort first by the count of the top-level sub-keys. In case of a tie sort by the sub-keys themselves.

I would like to get:

1 = 282:37
2 = 282:38
3 = 282:39
4 = 212:41
5 = 212:42
6 = 212:49
[download]

There are 3 keys for item 282 and 3 keys for item 312 so now we sort by sub-key. The item sub-key values have no relevance for this sort
TIA
Glenn