Find Minimum Possible Size

Problem Overview

• Task: Given an array of n integers, delete elements by pairing i and j where 2*arr[i] ≤ arr[j], with each element used at most once.
• Input/Output: Input is an integer array; output the minimum possible array size after any number of valid operations (including zero).
• Context: Models array reduction and data optimization under inequality constraints.
• Source: From Mathworks interviews; a classic coding interview problem and interview question.