返回set／multiset大于key的元素个数

#include <iostream>#include <algorithm>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <string.h>#include <map>#include <set>#include <queue>#include <deque>#include <list>#include <bitset>#include <stack>#include <stdlib.h>#define lowbit(x) (x&-x)#define e exp(1.0)#define eps 1e-8//ios::sync_with_stdio(false);//    auto start = clock();//    cout << (clock() - start) / (double)CLOCKS_PER_SEC<<endl;typedef long long ll;typedef long long LL;using namespace std;typedef unsigned long long ull;int a[200000+10];multiset<int>s;int main(){    ios::sync_with_stdio(false);    int n;    cin>>n;    auto start = clock();    for(int i=0;i<n;i++)        a[i]=200000-i;//cin>>a[i];    if(n==1)    {        cout<<0<<endl;        return 0;    }    cout<<0;    s.insert(a[0]);    for(int i=1;i<n;i++)    {        cout<<' '<<s.size()-distance(s.begin(),s.upper_bound(a[i]));        s.insert(a[i]);    }    cout<<endl;    cout << (clock() - start) / (double)CLOCKS_PER_SEC<<endl;    return 0;}