Loud and Rich

Statement

You’re given a group of people where everyone has a specific amount of money and a different level of quietness. Additionally, you’re given an array richer = [$x_{i}$, $y_{i}$], so that $x_{i}$ has more money than $y_{i}$. The quietness level of each person is represented using an array named quiet.

Return an integer array res, where res[i] = y if y has the lowest value in quiet[y] among all people who have equal or more money than the person i.

Constraints:

• $n =$ quiet.length
• $1 \leq$ $n$ $\leq 500$
• $0 \leq$ quiet[i] $<$ $n$
• All the values of quiet are unique.
• $0 \leq$ richer.length $\leq n * (n - 1) / 2$
• $0 \leq$ x[i], y[i] $<$ n
• $x_{i}$ $!=$ $y_{i}$
• All the pairs of richer are unique.
• The observations in richer are all logically consistent.

Example