2023牛客寒假算法基础集训营5-A

https://ac.nowcoder.com/acm/contest/46813/A

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define pb push_back
#define SZ(v) ((int)v.size())
#define fs first
#define sc second
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
int n,q;
ll a[100010],sum[100010];
int main(){
    cin>>n>>q;
    rep(i,1,n){
        scanf("%lld",&a[i]);
    }
    sort(a+1,a+1+n);
    rep(i,1,n){
        sum[i]=a[i]+sum[i-1];
    }
    int k,x;
    rep(i,1,q){
        scanf("%d%d",&k,&x);
        int pos=(upper_bound(a+1,a+1+n,x)-a)-1;
        printf("%lld\n",sum[pos]-sum[max(pos-k,0)]);
    }
    return 0;
}