| # | 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 | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
I tried with this problem with all my powers ... that's how I tried to solve the problem first I calculated the max from the first column x[i][0] and if there are two max's go to the second column x[i][1] and calculate the max between the two first max's ,, finally print the answer and the round 1 or 2 ...
If I miss any thing please help me .. :)
I tried twice but i just unable to understand this question. Can you help in understanding this question using sample test case :). Then i may help you.
he said that give him some examples from that problem
and explain him the answer of the test
Read the problem statements and compare it with my understanding to the problem the link in the head of the question.