Submission #63521861

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <array>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <random>
#include <ctime>
#define FOR(i, m, n) for (long long i = m; i <= n; i++)
#define FRO(i, m, n) for (long long i = m; i >= n; i--)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mp(a, b) make_pair(a, b)
#define pll pair<ll,ll>
using namespace std;
inline ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0' && ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();return x*f;}
inline ll binpow(ll a,ll b,ll m){a%=m;ll res=1;while(b>0){if(b&1)res=(res*a)%m;a=(a*a)%m;b>>=1;}return res;}


ll b[1000006],a[1000006],w[1000005],dp[1000005];
bool cmp(ll x,ll y){return x>y;}
int main(){
    ll n=read(),m=read();
    ll sum=0;
    FOR(i,1,n)b[i]=read(),sum+=(b[i]>0?b[i]:0);
    FOR(i,1,m)w[i]=read(),sum+=(w[i]>0?w[i]:0);
    sort(b+1,b+1+n,cmp);
    sort(w+1,w+1+m,cmp);
    ll ans=0;
    FOR(i,1,n){
        a[i]=a[i-1]+b[i]+(w[i]>0?w[i]:0);
        ans=max(ans,a[i]);
    }
    cout<<max(ans,0ll)<<endl;
    return 0;
}

Submission Info

Judge Result