At the end of the contest, my submission for this problem gave me a runtime error on case 19. This program solved larger cases of this problem but apparently not this one. Does anyone know why this happened? Here is the submission
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
At the end of the contest, my submission for this problem gave me a runtime error on case 19. This program solved larger cases of this problem but apparently not this one. Does anyone know why this happened? Here is the submission
| Название |
|---|



Your sorting function is causing the RE. Write "return(a.money<b.money);" inside it instead. Got AC: http://mirror.codeforces.com/contest/580/submission/13172132
To further exaplain, imagine you have three friends all with 5 money, X,Y and Z. Your function would say that X>Y, Y>Z, and Z>X. This will mean that the sort will keep sorting on and on forever, trying to get it right, but it never will because X can be greater or smaller than Y depending if it is the a parameter or b parameter.
If you set n=d=1000 and v[i].money=v[i].friendship=123 it will throw the exception.
Oh, I see now. Thank you very much!