Submission #71848249

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n, m; cin >> n >> m;
    vll a(n), b(m);
    rep(i, n)cin >> a[i];
    rep(i, m)cin >> b[i];
    sort(all(b));
    vll s(m+1, 0);
    rep(i, m)s[i+1] = s[i] + b[i];
    mint ans = 0;
    rep(i, n){
        ll c = lower_bound(all(b), a[i]) - begin(b);
        ll t = c*a[i] - s[c] + s[m] - s[c] - a[i]*(m-c);
        //cout << t << endl;
        ans += mint(t);
    }cout << ans.val() << endl;

    return 0;
}

Submission Info

Judge Result