You are given two string arrays creators and ids, along with an integer array views, all of length $n$. The $i^{ ext{th}}$ video was created by creators[i], has an identifier ids[i], and has received views[i] views.

The popularity score of a creator is defined as the sum of views across all videos they have produced.

Find the creator with the maximum popularity score. If multiple creators share the highest popularity score, select all of them.

For each of the most popular creators, determine their most viewed video identifier:

• If a creator has multiple videos tied for the highest view count, choose the video whose identifier is lexicographically smallest.

Return a list of pairs [creator, id] representing each top creator and the identifier of their most viewed video. The answer may be returned in any order.

Constraints:

• $n =$ creators.length $=$ ids.length $=$ views.length

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

• $1 \leq$ creators[i].length, ids[i].length $\leq 5$

• creators[i] and ids[i] consist only of lowercase English letters.

• $0 \leq$ views[i] $\leq 10^5$

Now, 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.