aboutsummaryrefslogtreecommitdiff
path: root/challenge-279/atschneid/perl/ch-1.pl
blob: 767d3b6629c3e7e91cc04fb2ffda9b0a6f08032e (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
use strict;
use warnings;

use v5.38;

my @inputs = (
    [
     ['R', 'E', 'P', 'L'],
     [3, 2, 1, 4]
    ],
    [
     ['A', 'U', 'R', 'K'],
     [2, 4, 1, 3]
    ],
    [
     ['O', 'H', 'Y', 'N', 'P', 'T'],
     [5, 4, 2, 6, 1, 3]
    ],
    [
     ['O', 'H', 'Y', 'N', 'P', 'A', 'T'],
     [5, 4, 2, 6, 1, 3, 3]
    ]
    );

for (@inputs) {
    my @letters = @{$_->[0]};
    my @weights = @{$_->[1]};
    say join ( ", ", @letters ) . " :: " .
	join ( ", ", @weights ) . " => " .
	sort_letters( \@letters, \@weights );
}

sub sort_letters( $letters, $weights ) {
    my @letters = @$letters;
    my @weights = @$weights;

    die "inputs must be the same length" unless $#weights == $#letters;

    my @zipped = map {[$weights[$_], $letters[$_]]} (0 .. $#weights);
    return join '', map { $_->[1] } sort {$a->[0] <=> $b->[0]} @zipped;
}