Triplet sum in array in cpp

//Using hash map
```

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n=6;
    int a[n]={1,4,6,7,8,9};
    int x=24;
    for(int i=0;i<n-1;i++)
    {
        unordered_set<int>s;
        int cs=x-a[i];
        cout<<"cs"<<cs<<endl;
        for(int j=i+1;j<n;j++)
        {
            if(s.find(cs-a[j])!=s.end())
            {
                cout<<a[i]<<" "<<a[j]<<" "<<cs-a[j]<<endl;
            }
            s.insert(a[j]);
            
        }
    }

    return 0;
}
```
// by using normal method
```
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n=6;
    int a[n]={1,2,3,4,10,45};
    int x=57;
    for(int i=0;i<n;i++)
    {
        int l=i+1;
        int r=n-1;
        while(l<r)
        {
          int sum=a[i]+a[l]+a[r];
          if(sum==x)
          {
              cout<<a[i]<<" "<<a[l]<<" "<<a[r];
              break;
          }
          else if(sum>x)
          {
              r--;
          }
          else
          {
              l++;
          }
        }
    }

    return 0;
}