PAT-A1048. Find Coins (25)

two pointer做的

#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>using namespace std;#define MAX 100000+10int coin[MAX];int cmp(const void *a, const void *b){return *(int*)a - *(int*)b;}int main(){freopen("in.txt", "r", stdin);//freopen("out.txt", "w", stdout);int N, M;scanf("%d %d", &N, &M);for (int i = 0; i < N; i++)scanf("%d", &coin[i]);qsort(coin, N, sizeof(int), cmp);int i = 0, j = N-1;while (coin[i]+coin[j] != M && i < j){if (coin[i]+coin[j] > M)j--;elsei++;}if (i >= j)printf("No Solution");elseprintf("%d %d", coin[i], coin[j]);return 0;}