I was trying to the [this](https://cses.fi/problemset/task/1640/) question and during that, I used the following code. ↵
↵
~~~~~↵
void solve() {↵
↵
read(n); read(x);↵
map<int,int>mp;↵
for(int i = 0; i< n; i++){↵
int a; cin>>a;↵
if(mp.find(a) != mp.end()){↵
int b = mp[a]+1;↵
cout<<b<<" "<<i+1<<endl;↵
return;↵
}↵
else{↵
mp[x-a] = i;↵
}↵
}↵
cout<<"IMPOSSIBLE"<<endl;↵
↵
↵
}↵
~~~~~↵
this did not give any tle error but when i used the following code ↵
↵
↵
~~~~~↵
void solve() {↵
↵
read(n); read(x);↵
unordered_map<int,int>mp;↵
for(int i = 0; i< n; i++){↵
int a; cin>>a;↵
if(mp.find(a) != mp.end()){↵
int b = mp[a]+1;↵
cout<<b<<" "<<i+1<<endl;↵
return;↵
}↵
else{↵
mp[x-a] = i;↵
}↵
}↵
cout<<"IMPOSSIBLE"<<endl;↵
↵
↵
}↵
~~~~~↵
it was giving tle in the test cases 23 and 24. now I know that both of them are the same except for the use of data structure, but the map should be slower than unordered_map but the opposite is true, why is this happening can anyone explain?↵
↵
[code of unordered_map](https://cses.fi/paste/93e2e3b621eed69579e8b4/)↵
↵
[code for map](https://cses.fi/paste/817dd306bdee85e279e8c5/)↵
↵
~~~~~↵
void solve() {↵
↵
read(n); read(x);↵
map<int,int>mp;↵
for(int i = 0; i< n; i++){↵
int a; cin>>a;↵
if(mp.find(a) != mp.end()){↵
int b = mp[a]+1;↵
cout<<b<<" "<<i+1<<endl;↵
return;↵
}↵
else{↵
mp[x-a] = i;↵
}↵
}↵
cout<<"IMPOSSIBLE"<<endl;↵
↵
↵
}↵
~~~~~↵
this did not give any tle error but when i used the following code ↵
↵
↵
~~~~~↵
void solve() {↵
↵
read(n); read(x);↵
unordered_map<int,int>mp;↵
for(int i = 0; i< n; i++){↵
int a; cin>>a;↵
if(mp.find(a) != mp.end()){↵
int b = mp[a]+1;↵
cout<<b<<" "<<i+1<<endl;↵
return;↵
}↵
else{↵
mp[x-a] = i;↵
}↵
}↵
cout<<"IMPOSSIBLE"<<endl;↵
↵
↵
}↵
~~~~~↵
it was giving tle in the test cases 23 and 24. now I know that both of them are the same except for the use of data structure, but the map should be slower than unordered_map but the opposite is true, why is this happening can anyone explain?↵
↵
[code of unordered_map](https://cses.fi/paste/93e2e3b621eed69579e8b4/)↵
↵
[code for map](https://cses.fi/paste/817dd306bdee85e279e8c5/)↵
