Triplet Sum in Array

/*
Given an array A[] of N numbers and another number x,
determine whether or not there exist three elements 
in A[] whose sum is exactly x.
*/


#include <bits/stdc++.h>
using namespace std;

bool tripletSum(int arr[], int n, int x)
{
    sort(arr, arr+n);
    for(int i = 0; i < n-2; i++) {
        int l = i+1;
        int r = n-1;
        while(l < r) {
            int sum = arr[i] + arr[l] + arr[r];
            if(sum == x) {
                return true;
            } else if (sum > x) {
                r--;
            } else {
                l++;
            }
        }
    }
    
    return false;
}

int main() {
    int n;
    int x;
    cin >> n;
    cin >> x;
    int arr[n];
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    
    cout << tripletSum(arr, n, x) << endl;

	return 0;
}