pat:1048. Find Coins (25) (double pointer method) AC

#include<stdio.h>#include<algorithm>Usingnamespace Std;int arr[100066];int main () {int n,m; scanf"%d%d", &n,&m);Forint i=0; I<n; ++i) scanf ("%d", &arr[i]); Sort (arr,arr+n);int l=0,r=n-1; //around pointer while (l<r) //"caution" There can be no "=" here, equals words to go in l=r the same coordinate cannot be 2 numbers {int tmp=arr[l]+arr[r]; if (tmp==m) //the sum of the numbers pointing to the left and right pointers is equal to M, that is to find {printf ( "%d%d" arr[l],arr[r]); return 0;} else if (tmp<m) //and less than m, left pointer back, increase TMP ++l; else //greater than M, right pointer forward, decrease TMP--r;} printf (" no solutionreturn 0;}          

pat:1048. Find Coins (25) (double pointer method) AC