蓝桥杯省赛无忧 编程24 聪明的小羊肖恩

蓝桥云课 聪明的小羊肖恩

#include<bits/stdc++.h>
using namespace std;
using ll = long long ;
const int N = 2e5 + 9;
int a[N];
int main()
{
  int n , L , R ; cin >> n >> L >> R;
  for(int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1,a + 1 + n);
  ll res = 0;
  for(int i = 1; i <= n; i++)
  {
    ll l = L - a[i] , r = R - a[i];
    res += upper_bound(a + i + 1,a + 1 + n,r) - lower_bound(a + i + 1,a + 1 + n,l);
  }
  cout << res << endl;
  return 0;
}