Submission #68325531

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define fi first
#define se second
#define ld long double
#define pi pair<int, int>
#define mp make_pair
#define vi vector<int>
#define vvi vector<vector<int>>

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

const int INF = (int)4e18;
const int MODa = 1e9 + 7;
const int MOD = 998244353;

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    int n, q;
    cin>>n>>q;

    vector<int> a(n+1, 0);

    for(int i=1; i<=n; i++)
    {
        cin>>a[i];
    }

    sort(a.begin()+1, a.end());
    vector<int> p(n+1, 0);
    for(int i=1; i<=n; i++)
    {
        p[i] = p[i-1] + a[i];
    }

    for(int i=1; i<=q; i++)
    {
        int b;
        cin>>b;

        auto it = lower_bound(a.begin()+1, a.end(), b);
        if(it==a.end())
        {
            cout<<-1<<"\n";
            continue;
        }

        int x = (it-a.begin());
        int ans = p[x-1] + (b-1)*(n-x+1) + 1;
        cout<<ans<<"\n";
    }
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;  
    // cin>>t;
    while(t--)
    {
        solve();
    }

    return 0;
}

Submission Info

Judge Result