Hi codeforces! I was deleting the element from ordered map but when i delete the last element from map then i got the RE! why? :(
code
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hi codeforces! I was deleting the element from ordered map but when i delete the last element from map then i got the RE! why? :(
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin>>n;
map<int,int>a;
for(int i=1;i<=n;i++){
int x; cin>>x;
a[i]=x;
}
map<int,int>::iterator it=a.begin();
a.erase(it);
// a.erase(it);
// if i uncomment the upper line then i got RE because iam deleting the last element :(
/* input
2
1 2
iam considering that my ordered map have only 2 elements.
*/
}
int main(){
solve();
}
Name |
---|
iterators don't work that way
if you erase like in the code, then
it
will be invalidated, or you can say it "doesn't work" anymoreyou can just call
a.erase(a.begin())
twice