Link for the code:
Used min heap priority queue to store the missing numbers from the given array and a map to store the numbers which are repeated more than once.
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 156 |
6 | Qingyu | 155 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
What's the error? (Codeforces Round #842 -Problem-C)
Link for the code:
Used min heap priority queue to store the missing numbers from the given array and a map to store the numbers which are repeated more than once.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 |
![]() |
Raks_splunk | 2023-01-06 15:52:19 | 2 | ||
en2 |
![]() |
Raks_splunk | 2023-01-06 15:46:34 | 1611 | ||
en1 |
![]() |
Raks_splunk | 2023-01-06 15:44:57 | 1829 | Initial revision (published) |
Name |
---|