Problem p02028 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7; // 924844033 1000000000 + 7;
constexpr long long INF = numeric_limits<LL>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr << #x << ": " << x << '\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll {
  LL first, second, third;
};
struct Fll {
  LL first, second, third, fourth;
};
typedef pair<LL, Tll> Ptll;
#define rep(i, rept) for (LL i = 0; i < rept; i++)
#define Rrep(i, mf) for (LL i = mf - 1; i >= 0; i--)
LL h, w, n, m, k, t, s, p, q, last, first, cnt, sum[2][300000], ans,
    dp[30][200000], a[200000], b[200000];
string str, ss;
bool f;
char c;
int di[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
struct Edge {
  LL to, cost;
};
struct edge {
  LL from, to, cost;
};
vector<vector<Edge>> vec;
vector<edge> ed;
vector<LL> v;
map<LL, LL> ma;
set<LL> st;
void YN(bool f) {
  if (f)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
void yn(bool f) {
  if (f)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
map<LL, LL> zip;
int unzip[20000];

int compress(vector<LL> &x) {
  sort(x.begin(), x.end());
  x.erase(unique(x.begin(), x.end()), x.end());
  for (int i = 0; i < x.size(); i++) {
    zip[x[i]] = i;
    unzip[i] = x[i];
  }
  return x.size();
}

int main() {
  cin >> n >> m;
  rep(i, n) {
    cin >> a[i];
    v.push_back(a[i]);
    k += a[i];
  }
  rep(i, m) {
    cin >> b[i];
    v.push_back(b[i]);
  }
  v.push_back(0);
  compress(v);
  rep(i, n) a[i] = zip[a[i]], sum[0][a[i]]++, sum[1][a[i]] += unzip[a[i]];
  rep(i, m) b[i] = zip[b[i]];
  rep(i, 210000) sum[0][i + 1] += sum[0][i], sum[1][i + 1] += sum[1][i];

  rep(i, m) { ans += (n - sum[0][b[i]]) * unzip[b[i]] + sum[1][b[i]]; }
  cout << ans << endl;
  return 0;
}
/*
 245
3
1
5
*/


Fixed submission:
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7; // 924844033 1000000000 + 7;
constexpr long long INF = numeric_limits<LL>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr << #x << ": " << x << '\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll {
  LL first, second, third;
};
struct Fll {
  LL first, second, third, fourth;
};
typedef pair<LL, Tll> Ptll;
#define rep(i, rept) for (LL i = 0; i < rept; i++)
#define Rrep(i, mf) for (LL i = mf - 1; i >= 0; i--)
LL h, w, n, m, k, t, s, p, q, last, first, cnt, sum[2][300000], ans,
    dp[30][200000], a[200000], b[200000];
string str, ss;
bool f;
char c;
int di[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
struct Edge {
  LL to, cost;
};
struct edge {
  LL from, to, cost;
};
vector<vector<Edge>> vec;
vector<edge> ed;
vector<LL> v;
map<LL, LL> ma;
set<LL> st;
void YN(bool f) {
  if (f)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
void yn(bool f) {
  if (f)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
map<LL, LL> zip;
LL unzip[300000];

int compress(vector<LL> &x) {
  sort(x.begin(), x.end());
  x.erase(unique(x.begin(), x.end()), x.end());
  for (int i = 0; i < x.size(); i++) {
    zip[x[i]] = i;
    unzip[i] = x[i];
  }
  return x.size();
}

int main() {
  cin >> n >> m;
  rep(i, n) {
    cin >> a[i];
    v.push_back(a[i]);
    k += a[i];
  }
  rep(i, m) {
    cin >> b[i];
    v.push_back(b[i]);
  }
  v.push_back(0);
  compress(v);
  rep(i, n) a[i] = zip[a[i]], sum[0][a[i]]++, sum[1][a[i]] += unzip[a[i]];
  rep(i, m) b[i] = zip[b[i]];
  rep(i, 210000) sum[0][i + 1] += sum[0][i], sum[1][i + 1] += sum[1][i];

  rep(i, m) { ans += (n - sum[0][b[i]]) * unzip[b[i]] + sum[1][b[i]]; }
  cout << ans << endl;
  return 0;
}
/*
 245
3
1
5
*/