#include <iostream>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fo(i,start,end) for(ll i=start;i<end;i++)
 
int main(){
	vector<ll>arr =  { 1, 5, 2 ,4 ,1};
	int k = 3;
	ll n =  5; 
	unordered_map<int,int>mp; // store element -> frequency
	fo(j,0,n){
		ll query = k + arr[j];
		if(mp.find(query) != mp.end()){
			//element is present
			cout<<"Pairs are {"<<mp[query]<<","<<j<<"}"<<endl;
			return 0;
	}
	mp[arr[j]] = j;
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwp1c2luZyBsbCA9IGxvbmcgbG9uZzsKI2RlZmluZSBmbyhpLHN0YXJ0LGVuZCkgZm9yKGxsIGk9c3RhcnQ7aTxlbmQ7aSsrKQogCmludCBtYWluKCl7Cgl2ZWN0b3I8bGw+YXJyID0gIHsgMSwgNSwgMiAsNCAsMX07CglpbnQgayA9IDM7CglsbCBuID0gIDU7IAoJdW5vcmRlcmVkX21hcDxpbnQsaW50Pm1wOyAvLyBzdG9yZSBlbGVtZW50IC0+IGZyZXF1ZW5jeQoJZm8oaiwwLG4pewoJCWxsIHF1ZXJ5ID0gayArIGFycltqXTsKCQlpZihtcC5maW5kKHF1ZXJ5KSAhPSBtcC5lbmQoKSl7CgkJCS8vZWxlbWVudCBpcyBwcmVzZW50CgkJCWNvdXQ8PCJQYWlycyBhcmUgeyI8PG1wW3F1ZXJ5XTw8IiwiPDxqPDwifSI8PGVuZGw7CgkJCXJldHVybiAwOwoJfQoJbXBbYXJyW2pdXSA9IGo7Cgl9CglyZXR1cm4gMDsKfQ==