Submission #68378737

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef tuple<int, int, int> ti;
typedef vector<bool> vb;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> OS;
//FOR BLITZ READING INPUT/OUTPUT TEXT FILES
//ifstream fin("input.txt");
//ofstream fout("output.txt");

void solve() {
    int n, q;
    cin >> n >> q;
    vll vals(n);
    rep(i, 0, n) cin >> vals[i];
    sort(all(vals));
    vll res(1000001, -1);
    int lidx = 0;
    ll num = n;
    ll cur = 1 - n;
    for (int i = 1; i <= vals[n - 1]; i++) {
        while (vals[lidx] < i - 1) lidx++, num--;
        cur += num;
        res[i] = cur;
    }
    for (int i = 0; i < q; i++) {
        int v;
        cin >> v;
        cout << res[v] << endl;
    }
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int test = 1;
    //cin >> test;
    for (int t = 0; t < test; t++) {
        solve();
    }
}

Submission Info

Judge Result