Pagini recente » Cod sursa (job #2863781) | Cod sursa (job #3291136) | Cod sursa (job #558067) | Cod sursa (job #3169489) | Cod sursa (job #1452210)
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
freopen("nrtri.in", "r", stdin);
freopen("nrtri.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int n, v[805];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v, v + n);
int ans = 0;
for (int i = 0; i < n - 2; i++) {
for (int j = i + 1; j < n - 1; j++) {
int st = j + 1, dr = n - 1;
while (st <= dr) {
int mij = (st + dr) / 2;
if (v[mij] > v[i] + v[j]) {
dr = mij - 1;
} else {
st = mij + 1;
}
}
ans += (dr - j);
}
}
cout << ans;
return 0;
}