提出 #57784852

---

ソースコード 拡げる

#if !__INCLUDE_LEVEL__
#include __FILE__



int main(){
    ll N;cin>>N;
    vector<int> X(N);
    vector<vector<ll>> XP(N, vector<ll>(2));rep(i,0,N){cin>>XP[i][0]; X[i] = XP[i][0];}
    rep(i,0,N)cin>>XP[i][1];
    ll Q;cin>>Q;
    vector<ll> L(Q),R(Q);rep(i,0,Q){cin>>L[i]>>R[i]; }
    std::sort(XP.begin(), XP.end(), [](const std::vector<ll>& a, const std::vector<ll>& b) {
        // 最初の要素で比較し、同じ場合は2番目の要素で比較
        return a[0] < b[0];
    });
    sort(X.begin(),X.end());
    vector<ll> sum(N+1);
    sum[0] = 0;
    rep(i,1,N+1){
        sum[i] = sum[i-1] + XP[i-1][1];
    }
    
    // print_vec(sum);
    rep(i,0,Q){
        auto position=lower_bound(X.begin(),X.end(),L[i]);
        ll lIdx=distance(X.begin(), position);
         position=upper_bound(X.begin(),X.end(),R[i]);
        ll rIdx=distance(X.begin(), position);
        // cout<<rIdx<<spa<<lIdx<<endl;
        cout<<sum[rIdx]-sum[lIdx]<<endl;

    }
    
    return 0;
}

#else
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;

#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)
#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )

const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";

//配列の要素を空白区切りで出力 第二引数をtrueにすると改行区切り
template<class T> inline void print_vec(const vector<T>& v, bool split_line=false) {
    if(v.empty()){
        cout << "This vector is empty." << el;
        return;
    }
    for (int i = 0; i < v.size(); i++) {
        if(v[i]==inf || v[i]==infl) cout << 'x' << " \n"[split_line || i+1==(int)v.size()];
        else cout << v[i] << " \n"[split_line || i+1==(int)v.size()];
    }
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

#endif

提出情報

ジャッジ結果