Submission #32387176

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXn = 2e5;

template <typename T>
inline void read(T &a) {
	char c;for (c = getchar(); (c < '0' || c > '9') && c != '-'; c = getchar());bool f = c == '-';T x = f ? 0 : (c ^ '0');for (c = getchar(); c >= '0' && c <= '9'; c = getchar()) {x = x * 10 + (c ^ '0');}a = f ? -x : x;
}
template <typename T, typename ...Argv>
inline void read(T &a, Argv &...argv) {
	read(a), read(argv...);
}

int n, q;
int a[MAXn + 10];
int suma[MAXn + 10];
inline int Dic(int x) {
	int L = 1, R = n, M;
	while (L < R) {
		M = (L + R + 1) >> 1;
		if (a[M] <= x) L = M;
		else R = M - 1;
	}
	if (a[L] <= x) return L;
	else return 0;
}

signed main() {
	read(n, q);
	for (int i = 1; i <= n; ++i) {
		read(a[i]);
	}
	sort(a + 1, a + 1 + n);
	for (int i = 1; i <= n; ++i) {
		suma[i] = suma[i - 1] + a[i];
	}
	for (int i = 1, x; i <= q; ++i) {
		read(x);
		int p = Dic(x);
		printf("%lld\n", x * p - suma[p] + (suma[n] - suma[p]) - x * (n - p));
	}
	return 0;
}

Submission Info

Judge Result