#include <bits/stdc++.h>
using namespace std;
int ans(int arr[],int n,int k){
unordered_set<int>m;
for(int i=0;i<n;i++){
int x=k-arr[i];
if(m.find(x)!=m.end()){
return 0;
}
else{
m.insert(arr[i]);
}
}
return -1;
}
int main() {
// your code goes here
int arr[]={1,-2,1,0,5};
int n=sizeof(arr)/sizeof(arr[0]);
int k=0;
if(ans(arr,n,k)==-1){
cout<<"false";
}
else{
cout<<"true";
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBhbnMoaW50IGFycltdLGludCBuLGludCBrKXsKCXVub3JkZXJlZF9zZXQ8aW50Pm07Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlpbnQgeD1rLWFycltpXTsKCQlpZihtLmZpbmQoeCkhPW0uZW5kKCkpewoJCQlyZXR1cm4gMDsKCQl9CgkJZWxzZXsKCQkJbS5pbnNlcnQoYXJyW2ldKTsKCQl9Cgl9CglyZXR1cm4gLTE7CiAKfQppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBhcnJbXT17MSwtMiwxLDAsNX07CglpbnQgbj1zaXplb2YoYXJyKS9zaXplb2YoYXJyWzBdKTsKCWludCBrPTA7CiAKCWlmKGFucyhhcnIsbixrKT09LTEpewoJCWNvdXQ8PCJmYWxzZSI7Cgl9CgllbHNlewoJCWNvdXQ8PCJ0cnVlIjsKCX0KCXJldHVybiAwOwp9