Codeforces Round #807 (Div 2.) A·B·C

#include <bits/stdc++.h>
using namespace std;

const int N=1e6+3;

int a[N];

int main(){

    int t;

    scanf("%d",&t);

    while(t--){

        int n,x;
        scanf("%d%d",&n,&x);

        for(int i=0;i<n*2;i++) scanf("%d",&a[i]);

        sort(a,a+n*2);  //排序

        bool flag=1;
        for(int i=0,j=n;i<n;i++,j++){  //i从0~n-1  j从n~2*n-1
            if(a[j]-a[i]<x){
                flag=0;
                break;
            }
        }
        if(flag) printf("YES\n");
        else printf("NO\n");

    }

    return 0;

}

#include <bits/stdc++.h>
using namespace std;

int t;

const int N=1e6+3;

int a[N];

int main(){

    cin>>t;

    while(t--){

        int n;

        cin>>n;

        for(int i=0;i<n;i++) cin>>a[i];

        int p=0;

        while(p<n&&a[p]==0) p++;

        long long cnt=0;

        for(int i=p;i<n-1;i++){

            cnt+=a[i];
            if(a[i]==0) cnt++;

        }

        cout<<cnt<<endl;

    }

    return 0;

}

#include <bits/stdc++.h>
using namespace std;

const int N=1e6+3;

typedef long long LL;

LL l[N],r[N],nl[N],nr[N];
//l和r数组存储每次copy的l和r
//nl和nr数组存储copy之后，l和r的位置 

void solve(){

    LL n,m,q;

    cin>>n>>m>>q;

    string s;

    cin>>s;

    nl[0]=0,nr[0]=n;

    for(int i=1;i<=m;i++){

        cin>>l[i]>>r[i];
        nl[i]=nr[i-1]+1;  //更新nl 
        nr[i]=nl[i]+(r[i]-l[i]+1)-1;  //更新nr 

    }

    while(q--){

        LL k;
        cin>>k;

        for(int i=m;i>=1;i--){  //枚举区间
            if(nl[i]<=k&&k<=nr[i]) k-=nl[i]-l[i];
        }

        cout<<s[k-1]<<endl;

    }

}

int main(){

    LL t;

    cin>>t;

    while(t--){
        solve();
    }

    return 0;

}