3SUM

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, x;
    cin >> n >> x;

    vector<int> vec(n+1);
    for (int i = 1; i <= n; ++i) {
        cin >> vec[i];
    }

    sort(vec.begin(), vec.end());

    bool found = false;
    vector<int> sol;
    for(int i = n; i > 0 && !found; i--){
        if(vec[i] + 2 > x) continue;
        for(int j = i - 1; j > 0 && !found; --j){
            if(vec[i] + vec[j] + 1 > x) continue;
            for(int k = j - 1; k > 0 && !found; --k){
                if(vec[i] + vec[j] + vec[k] == x){
                    found = true;
                    sol.push_back(i);
                    sol.push_back(j);
                    sol.push_back(k);
                }
            }
        }
    }

    if(!found) cout << 0 << endl;
    else{
        for(int i = 0; i < 3; i++){
            cout << sol[i] << " ";
            if(i == 2) cout << endl;
        }
    }

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: ACCEPTED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: TIME LIMIT EXCEEDED

Test 22

Verdict: TIME LIMIT EXCEEDED

Test 23

Verdict: WRONG ANSWER