You are given an integer array pizzas of length n, where pizzas[i] represents the weight of the pizza at index i.

Every day, you choose exactly $4$ pizzas to eat until all pizzas are consumed, taking a total of $n / 4$ days.

The weight gained each day is determined as follows:

• On odd days (day $1$, day $3$, day $5$, and so on), you gain weight equal to the maximum weight among the $4$ selected pizzas.

• On even days (day $2$, day $4$, day $6$, and so on), you gain weight equal to the second largest weight among the $4$ selected pizzas.

Return the maximum total weight you can gain after eating all pizzas.

Constraints:

• $4 \leq n ==$ pizzas.length $\leq 2 imes 10^5$

• $1 \leq$ pizzas[i] $\leq 10^5$

• n is a multiple of $4$

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.