#!/bin/perl

=pod

L<https://theweeklychallenge.org/blog/perl-weekly-challenge-289#TASK1>

Author: Niels 'PerlBoy' van Dijke

Task 1: Third Maximum
Submitted by: Mohammad Sajid Anwar

You are given an array of integers, @ints.

Write a script to find the third distinct maximum in the given array.
If third maximum doesn’t exist then return the maximum number.

=cut

use v5.32;
use feature qw(signatures);
no warnings qw(experimental::signatures);
use common::sense;
use List::Util qw(uniq);

use Test2::V0 qw(-no_srand);

sub nThMaximum :prototype(\@$) ($arInts,$n){
  my @l = sort { $a <=> $b } uniq(@$arInts);
  $l[@l < $n ? -1 : -$n];
}

is(nThMaximum(@{[5,6,4,1]},3),4,'Example 1');
is(nThMaximum(@{[4,5]},    3),5,'Example 2');
is(nThMaximum(@{[1,2,2,3]},3),1,'Example 3');
is(nThMaximum(@{[5,3,2]},  2),3,'Own example');

done_testing;