vWwKOA - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b) {
    int x = 1;
    a %= M;
    while (b) {
        if (b & 1) x = (x * a) % M;
        a = (a * a) % M;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************


vector<int> a;
vector<int> q;

vector<int> consistency(int n, int m){
    vector<int> ans(m);

    sort(begin(a), end(a));


    vector<int> prefix(n+1);
    prefix[0] = a[0];
    for(int i=1; i<n; i++){
    	prefix[i] = prefix[i-1] + a[i];
    }

    vector<int> suffix(n+1);
    for(int i=n-1; i>=0; i--){
    	suffix[i] = suffix[i+1] + a[i];
    }

    for(int i=0; i<m; i++){
    	int j = upper_bound(begin(a), end(a), q[i]) - begin(a)-1;

    	ans[i] = ((j+1)*q[i] - prefix[j]) +  (suffix[j+1] - (n-j-1) * q[i]);
    }


    return ans;
}


vector<int> practice(int n, int m){


    return {};
}


void solve() {

    int n, m;
    cin>> n >> m;

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

    auto ans = consistency(n, m);
	for(auto& it : ans){
		cout << it << " ";
	}cout << endl;

}


int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

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

    return 0;
}