| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
I get The idea of Problem D Today But I was getting WA and I did not know where is the wrong.. After the contest I discovered that my map donot do sorting to vector of string in it ...
why ???
map<char, vector<string>>mp;
for(auto i:mp){
sort(i.second.begin(), i.second.end());
}
this is the test that my friend give me after contest:
1
1
D
9H 4H
you should have done sort(mp[i.first].begin(), mp[i.first].end());
ACCEPTED but Why ??
because u are sorting a copy without replacing it back to the map
thanks
sorting the vector, $$$mp[i.first]$$$, rather than its copy, $$$i$$$
Auto comment: topic has been updated by abdelaal_03 (previous revision, new revision, compare).
for (auto &i : mp), you just make a copy every time
Yes it's the reference trick.
Or you can use iterators:
for (auto it=mp.begin();it!=mp.end();it++) sort(it->second.begin(),it->second.end());