So I just started learning and trying to code this project and learn through the process and I might have landed in a bit of a complex situation. The idea is about "blind lowest bid wins" the product of the day (which is going to be a NFT). Each day the auction starts at 12 AM (or when a function for simplicity since we don't want to involve Oracles).
I was thinking of a mapping with key as bids and then values as address and bool indicating if it's unique. But with 2 decimal points for every number it runs to millions of values. What is the best and efficient way to store these, find the address with lowest unique bid as well as the bid value for the day, flush out and start fresh at 11.59PM the next day.
tl;dr: store all bids and addresses and find the lowest unique bid (while hiding the value of the bids), announce winner and flush out the values when the next day's auction begins. What's the best way to store this using Mapping and array?