two sum (n logn)
12345678910111213141516171819202122232425262728293031
#include <iostream>
#include<algorithm>
using namespace std;
int main() {
int n,a[100],x,i,j;
cin>>n;cin>>x;
for(i=0;i<n;i++)
cin>>a[i];
int sum=0;
sort(a, a+n, greater<int>());
for(i=0,j=n-1;i<n,j>=0;)
{
if(a[i]+a[j]<x)
{
j--;
}
else if(a[i]+a[j]>x)
{ i++;
}
else
{ sum=a[i]+a[j];
cout<<a[i]<<" "<<a[j];
break;
}
}
if(sum==0)
cout<<" sorry couldn't find ";
return 0;
}
Cpp
INFO