提出 #71855656

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))

typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};

template <class T>
inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const int mod = 998244353;

int N, M;

signed main() {
    cin >> N >> M;
    vector<int> A(N), B(M);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }
    for (int i = 0; i < M; ++i) {
        cin >> B[i];
    }
    sort(A.begin(), A.end());
    sort(B.begin(), B.end());
    vector<int> S(M + 1, 0);
    for (int i = 0; i < M; ++i) {
        S[i + 1] = S[i] + B[i];
    }
    int ans = 0;
    for (int i = 0; i < N; ++i) {
        auto itr = upper_bound(B.begin(), B.end(), A[i]);
        int idx = itr - B.begin();
        // cout << "idx: " << idx << endl;
        // 左項
        ans -= S[idx] - idx * A[i];
        ans = (ans + mod) % mod;
        // cout << "ans: " << ans << endl;
        // 右項
        ans -= (M - idx) * A[i] - (S[M] - S[idx]);
        ans = (ans + mod) % mod;
        // cout << "ans: " << ans << endl;
    }
    cout << ans << endl;
}

提出情報

ジャッジ結果