➤ Problem Link : OPCPIZZA
👉 Hint : edit please
✅ C++ Solution :
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll t;
cin>>t;
ll arr[100001];
while(t--)
{
ll n,m,ans=0;
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
for(int i=0;i<n;i++)
{
ans+=upper_bound(arr+i+1,arr+n,m-arr[i])-lower_bound(arr+i+1,arr+n,m-arr[i]);
// cout<<i<<" "<<ans<<endl;
}
cout<<ans<<endl;
}
}
Thank you for your patience reading. If you enjoyed this post, I’d be very grateful if you’d help it spread by emailing it to a friend, or sharing it on Whatsapp or Facebook.
😇Happy Learning!!
I am a Member Technical at D.E. Shaw India Pvt. Ltd. CodingWithArt is a blog where you find tricks and solutions to challenging coding and development problems. I aim to build a universal tech platform for every enthusiast out there.