You are given a $0$ indexed integer array nums.

Initially, all indices are unmarked. You can perform the following operation any number of times:

• Pick two distinct unmarked indices i and j such that $2 imes$ nums[i] $\leq$ nums[j].

• Mark both index i and index j.

Return the maximum possible number of marked indices after performing the operation optimally.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

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

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.