petya and array

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
#define suni ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl "\n"
#define mn int main()
#define frac() cout.unsetf(ios::floatfield);cout.precision(6);cout.setf(ios::fixed,ios::floatfield);
const ll mx=2e5+123;
ll sum[mx];
mn
{
    suni;
    ll n,t; cin>>n>>t;
    for(int i=1;i<=n;i++){
        ll a; cin>>a;
        sum[i]=a+sum[i-1];
        }
    ordered_set p;
    map<ll,ll>cnt;
    p.insert(0);
    cnt[0]++;
    ll ans=0;
    for(int i=1;i<=n;i++){
      ll d=sum[i]-t;
      ans+=(i-p.order_of_key(d)-cnt[d]);
      p.insert(sum[i]);
      cnt[sum[i]]++;
    }
    cout<<ans<<endl;
    }