Company: Myntra_20sep
Difficulty: medium
Student Pairing Problem Description You are tasked with organising a college event where you must pair off students for various activities. You have a list of 2N students, each with some skill levels. Your goal is to pair these students such that all students can participate in an activity following a specific set of rules. Initially, you select a positive integer y. Then, you must follow this procedure N times: select two students whose combined skill levels equal y, pair them together, and then update y to the higher skill level of the two students you just paired. Your task is to determine whether you can pair all the students in the following manner or not. Note that you choose y at the beginning and cannot change it between pairings. Input Format: The first line of each test case contains an integer N. The second line of each test case contains 2N integers S1, S2, ..., S2N – the skill levels of the students. Output Format: Print "YES" if it is possible to pair all students followi