The code in your post doesn't even compile, so given the lack of a clear description of your problem, I'll have to guess, but -- I take it that what you want to do is, given a hash that maps products (i.e. their names) to their prices, find the product with the lowest price?

If so, use values and keys, along with grep and List::Util's ever-useful min:

#!/usr/bin/perl

use strict;
use warnings;
use List::Util qw/min/;

my $sellable_products = {
    one => 1,
    two => 2,
};

my $lowest_price = min values %$sellable_products;
my @cheapest_products = grep { $sellable_products->{$_} == $lowest_pri
+ce } keys %$sellable_products;
[download]

The error message means that the method on the line that issues that error is being called on a value that is not a blessed reference. Most often when I get this error, it's because a subroutine unexpectedly returned an undef/empty list.

So unless you post a self-contained example that emits the cited error, it's all just guessing.

Hi kennethk, my apologies!
I actually do not care about the value of the Math::Currency object. I actually need the key for $lowest. I have updated my post

If you want the key that corresponds the the lowest value of a hash, instead of code like

my $lowest = min values $products_and_prices;
[download]

you'll want something like

my ($lowest) = sort {$products_and_prices->{$a} <=> $products_and_pric
+es->{$b}} keys $products_and_prices;
[download]

The parentheses create list context on the assignment, so that lowest gets assigned to the first list element, which is the item that was smallest. Of course, you could write something more efficient, and I haven't tested the above because you still haven't posted useful example code.

---

#11929 First ask yourself `How would I do this without a computer?' Then have the computer do it the same way.