You are given two string arrays positive_feedback and negative_feedback, containing positive and negative words respectively. You are also given two arrays report and student_id, where report[i] is a report describing the student with ID student_id[i], and an integer k.

Each student initially has $0$ points. The points of a student are determined by the words in their corresponding report[i]:

• Every occurrence of a word from positive_feedback increases the score by $3$ points.

• Every occurrence of a word from negative_feedback decreases the score by $1$ point.

Return the IDs of the top k students sorted in descending order of their total score. If two students have the same score, the student with the smaller student_id ranks higher.

Constraints:

• $1 \leq$ positive_feedback.length, negative_feedback.length $\leq 10^4$

• $1 \leq$ positive_feedback[i].length, negative_feedback[j].length $\leq 100$

• Both positive_feedback[i] and negative_feedback[j] consist of lowercase English letters.

• No word is present in both positive_feedback and negative_feedback.

• n $==$ report.length $==$ student_id.length

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

• report[i] consists of lowercase English letters and spaces ' '.

• There is a single space between consecutive words of report[i].

• $1 \leq$ report[i].length $\leq 100$

• $1 \leq$ student_id[i] $\leq 10^9$

• All the values of student_id[i] are unique.

• $1 \leq k \leq n$

Input: positive_feedback = ["excellent","focused"]-List[str], negative_feedback = ["late","careless"]-List[str], report = ["excellent excellent late","focused careless","late late careless"]-List[str], student_id = [814,239,672]-List[int], k = 2-int
Output: [814,239]-List[int]
Explanation: Student 814 scores 5 points, student 239 scores 2 points, and student 672 scores -3 points, so the top two students are [814,239].

Input: positive_feedback = ["kind"]-List[str], negative_feedback = ["rude"]-List[str], report = ["quiet learner","calm thinker","kind rude"]-List[str], student_id = [42,7,19]-List[int], k = 3-int
Output: [19,7,42]-List[int]
Explanation: Student 19 scores 2 points, while students 7 and 42 both score 0 points. Student 7 ranks ahead of student 42 because of the smaller student ID.

Input: positive_feedback = ["helpful","creative","clear"]-List[str], negative_feedback = ["confusing","rude"]-List[str], report = ["helpful clear creative","confusing rude clear","creative creative rude","ordinary work"]-List[str], student_id = [305,918,127,644]-List[int], k = 1-int
Output: [305]-List[int]
Explanation: Student 305 scores 9 points, student 127 scores 5 points, student 918 scores 1 point, and student 644 scores 0 points, so the top student is 305.

Input: positive_feedback = ["calm"]-List[str], negative_feedback = ["messy"]-List[str], report = ["messy calm calm"]-List[str], student_id = [501]-List[int], k = 1-int
Output: [501]-List[int]
Explanation: Student 501 scores 5 points from two occurrences of “calm” and one occurrence of “messy,” so student 501 is selected.

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.