Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int main()
- {
- int n,cnt=0;
- cin >> n;
- vector<int> v(n);
- for(int i=0;i<n;i++)
- cin >> v[i];
- sort(v.begin(),v.end());
- for(int i=0; i<n; i++)
- {
- for(int j=i+1; j<n;j++)
- {
- int poz = lower_bound(v.begin(), v.end(), v[i]+v[j]) - v.begin();
- cnt = cnt + poz - j - 1;
- }
- }
- cout << cnt;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement