Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- long long int i,n,j,k,ans=0,p,up;
- cin>>n>>k;
- vector<long long int>v;
- long long int a[n];
- for(i=0;i<n;i++)
- {
- cin>>p;
- v.push_back(p);
- }
- sort(v.begin(),v.end());
- for(i=0;i<n;i++)
- {
- if(v[i]<=(k-1)/2)
- {
- up=upper_bound(v.begin(),v.end(),k-1-v[i])-v.begin();
- // cout<<v[i]<<" "<<i<<" "<<up<<endl;
- ans+=(up-1-i);
- }
- }
- cout<<ans;
- return 0;
- }
Add Comment
Please, Sign In to add comment