Problem: 1424. G Years from Bubble Cup13 Final Round.
I couldn't find the editorials, but I found a solution(code), still I didn't get the logic behind it.Somebody help Thanks in advance :)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
Problem: 1424. G Years from Bubble Cup13 Final Round.
I couldn't find the editorials, but I found a solution(code), still I didn't get the logic behind it.Somebody help Thanks in advance :)
Название |
---|
The problem essentially goes:
You have people who live and die at certain years. In what year are the maximum amount of people alive?
To do this, make an array of pairs. The first pair has the year, and the second pair is a boolean, determing whether it is a death year or a birth year. Sort all years, create a variable which stores the maximum, and if you encounter a new max, store that current year. Then print out your year and your maximum.