Submission #63508490

---

Source Code Expand

#pragma GCC optimize("O3", "unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//#pragma comment(linker, "/STACK:268435456")
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <cstring>
//#include <sstream>
//#include <fstream>
#include <bitset>
#include <string>
#include <iomanip>

#include <chrono>
#include <random>

#define debug(x) cout << #x << "=" << x << "(DEBUG)\n"

#define rep(I, a, b) for(int I = a;I < b;I++)
#define repe(I, a, b) for(int I = a;I <= b;I++)
#define rrep(I, a, b) for(int I = a;I >= b;I--)
#define trav(I, ob) for(auto& I : ob)
#define YES cout << "Yes\n"
#define NO cout << "No\n"

typedef long long ll;
//#define int ll

const int maxn = 1e6 + 10;
const int maxn2 = 2e3 + 10;
//const int base = 2e5 + 5;
const int mod = 998244353;

using namespace std;

using pii = pair<int, int>;
using piii = pair<int, pii>;
using pdi = pair<double, int>;
using pdii = pair<double, pii>;
using pll = pair<ll, ll>;
using plll = pair<ll, pll>;
using pcc = pair<char, char>;
using pss = pair<string, string>;

const int mxx1 = 1e9 + 5;
const ll mxx2 = 1e17;

ll prefix1[maxn];
ll prefix2[maxn];

ll arr1[maxn];
ll arr2[maxn];

inline int solve() {
    int N, M;
    cin>>N>>M;
    rep(i,0,N)
        cin>>arr1[i];
    rep(i,0,M)
        cin>>arr2[i];
    sort(arr1,arr1+N,greater<>());
    sort(arr2,arr2+M,greater<>());
    int idx = N+1;
    repe(i,1,N){
        if(idx == N+1 && arr1[i-1]<0){
            idx=i-1;
        }
        prefix1[i]=prefix1[i-1]+arr1[i-1];
        prefix2[i]=prefix2[i-1]+arr2[i-1];
    }
    ll ans = 0;
    repe(i,0,M){
        ans = max(ans, prefix1[min(N, max(i,idx))]+prefix2[i]);
    }
    cout << ans << '\n';
    return 0;
}

//#define CF
//#define SUBMIT

signed main() {
#ifdef SUBMIT
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#else
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#endif
    int T = 1;
#ifdef CF
    cin >> T;
#endif // CF
    repe(i, 1, T) {
        //cout << "Testcase #" << i << '\n';
        solve();
    }
    return 0;
}

Submission Info

Judge Result