1048. Find Coins (25) -two pointers法

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#include <string>
#include <cstring>
#include <vector>
#include <queue>

using namespace std;

int a[100005];

int main()
{
   // freopen("in.txt","r",stdin);

    int N,M;
    scanf("%d %d",&N,&M);

    for(int i=0;i<N;i++)
        scanf("%d",&a[i]);
    sort(a,a+N);

    int i=0,j=N-1;
    while(i<j)
    {
        if(a[i]+a[j]==M)
        {
            printf("%d %d",a[i],a[j]);
            break;
        }
        else if(a[i]+a[j]>M)
            j--;
        else
            i++;
    }

    if(i>=j)
        printf("No Solution");



    return 0;
}