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
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 151 |
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
Name |
---|
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.