1048 Find Coins

#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
    int N,M,a[100000],i,j;
    cin>>N>>M;
    for(i=0;i<N;i++)cin>>a[i];
    
    sort(a,a+N);
    
    for(i=0,j=N-1;i<j;){
        int Sum=a[i]+a[j];
        if(Sum==M){
            cout<<a[i]<<' '<<a[j];
            return 0;
        }
        if(Sum<M){
            i++;
        }
        else{
            j--;
        }
    }
    cout<<"No Solution";
}
//1 2 2 4 7 8 11 15
//  7   8   9   10  11  12  13  14