Given an integer n and an array of distinct prime numbers primes, return the n-th super ugly number. A super ugly number is a positive integer whose only prime factors are from a given array primes.

The n-th super ugly number is guaranteed to fit within a 32-bit signed integer.

Constraints:

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ primes.length $\leq 100$

• $2 \leq$ primes[i] $\leq 1000$

• primes[i] is guaranteed to be a prime number.

• All the values of primes are unique and sorted in an ascending order.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.