| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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 mostafaabdelaal_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());I think using maps is overcomplicating