提出 #71859313

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <stack>
#include <set>
#include <unordered_map>
#include <string>
#include <cmath>

using namespace std;
using ll = unsigned long long;
int MOD = 998244353;

int search(vector<ll>& b, ll v) {
    int left = 0;
    int right = b.size()-1;
    int ans = -1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (b[mid] >= v) {
            ans = mid;
            right = mid - 1;
        }
        else {
            left = mid + 1;
        }
    }
    return ans;
}

void solve() {
    int n, m;
    cin >> n >> m;
    vector<ll> a(n);
    vector<ll> b(m);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++)cin >> b[i];
    sort(b.begin(), b.end());
    vector<ll> sum(m);
    sum[0] = b[0];
    for (int i = 1; i < m; i++)sum[i] = sum[i - 1] + b[i];
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        int pos = search(b, a[i]);
        if (pos != -1) {
            ans += pos == 0 ? 0 : (pos * a[i] - sum[pos - 1]);
            ans %= MOD;
            ans += pos == 0 ? (sum.back() - m * a[i]) : (sum.back() - sum[pos - 1] - (m - pos) * a[i]);
            ans %= MOD;
        }
        else {
            ans += m * a[i] - sum.back();
            ans %= MOD;
        }
    }
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

提出情報

ジャッジ結果