you have an array in one operation choose two different element and remove from array return minimum length of array
you can do this operation any number of times
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
you have an array in one operation choose two different element and remove from array return minimum length of array
you can do this operation any number of times
| Название |
|---|



Use greedy and don't use dp because why not
Store the count of all elements using a map.
If there is an element whose count x>floor(n/2) then answer is x-(n-x);
Else answer is 0 if n is even and 1 if n is odd.
(n=size of the array)
Thanks
Glad to help. Ask me if you don't understand my solution.