PAT甲级1048

#include <bits/stdc++.h>

using namespace std;
int rec[1002];///坑，当M == 1000（或某个比较大的数），V1是个较小的数，V2 = M-V1较大可能会越界
int main()
{
    int N, M;
    while(~scanf("%d%d", &N, &M)){
        memset(rec, 0, sizeof(rec));
        for(int i = 0; i < N; ++i) {
            int d;
            scanf("%d", &d);
            rec[d]++;
        }
        bool exist = 0;
        for(int i = 1; i <= 500 && i <= M/2; ++i){
            int V1 = i, V2 = M - V1;
            rec[V1]--;
            if(rec[V1] >= 0 && rec[V2] > 0){
                printf("%d %d\n", V1, V2);
                exist = 1;
                break;
            }
            rec[V1]--;
        }
        if(!exist) printf("No Solution\n");
    }

    return 0;
}