Minimum Unlocks

You have $n$ locks and $n$ keys. Each key unlocks only one lock. What is the maximum number of attempts needed to figure out all of the key-lock pairs using an optimal strategy? Report the answer when $n = 10$.