提出 #71857711

---

ソースコード 拡げる

#include <iostream>
#include <algorithm>
#include <deque>
#include <vector>
#include <queue>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <set>
#include <string>
using namespace std;

int n, m;
long long a[300001], b[300001], psum[300001];
const int MOD = 998244353;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);

	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> b[i];
	}
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; i++) {
		psum[i] = (psum[i - 1] + a[i]) % MOD;
	}
	long long ret = 0;
	for (int i = 1; i <= m; i++) {
		auto it = lower_bound(a + 1, a + n + 1, b[i]);
		int idx = it - (a + 1);
		ret += (b[i] * idx % MOD - psum[idx] + MOD) % MOD;
		ret += ((psum[n] - psum[idx] - b[i] * (n - idx)) % MOD + MOD) % MOD;
	}
	cout << (ret % MOD + MOD) % MOD;
}

提出情報

ジャッジ結果