Submission #63516675

---

Source Code Expand

#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
#define endl "\n"
#define rp(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define fp(i,a,b) for(int i=a;i>=b;i--)
#define IOS ios::sync_with_stdio(false),cout.tie(0),cin.tie(0);
using namespace std;
typedef pair<int, int> PII;
typedef unsigned long long ull;
typedef long long ll;
const ll INF = 1e9+10;
const ll mod = 998244353;
const int N = 2e5+5;
inline __int128 read(){
    __int128 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<<1)+(x<<3)+(ch^48);
        ch=getchar();
    }
    return x*f;
}
inline void write(__int128 x){
    if(x<0){
        putchar('-');
        x=-x;
    }
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
ll ksm(ll a, ll b)
{
    ll res = 1;
    while(b > 0)
    {
        if (b & 1) res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
void exgcd(int a, int b, int& x, int& y){
    if(b == 0){
        x=1,y=0;
        return;
    }
    exgcd(b,a%b,y,x);
    y-=a/b*x;
}

void c_prime(int n) {
    vector<ll> pri;
    bool not_prime[20000];//用的时候两个数组都开全局//不是质数的标记
    for (int i = 2; i <= n; ++i){
        if(!not_prime[i]){
            pri.push_back(i);
      }
    for (int pri_j : pri) {
        if (i * pri_j > n) break;
        not_prime[i * pri_j] = true;
        if (i % pri_j == 0) {
            break;
      }
    }
  }
}
#define int long long
int b[N],w[N],c[N];
void solve()
{
    int n,m;
    cin>>n>>m;
    rp(i,1,n)
    {
        cin>>b[i];
    }
    rp(i,1,m)
    {
        cin>>w[i];
    }
    sort(b+1,b+1+n);
    sort(w+1,w+1+m);
    int cnt=0;
    ll sum=0;
    int r=n;
    fp(i,m,1)
    {
        if(w[i]<=0)
            break;
        if(w[i]+b[r]>0)
        {
            sum+=(w[i]+b[r]);
            r--;
            if(r==0)
            {
                cout<<sum<<endl;
                return ;
            }
        }
    }
    fp(i,r,1)
    {
        if(b[i]>0)
        {
            sum+=b[i];
        }
    }
    cout<<sum<<endl;
}
signed main()
{
    IOS
    int TT = 1;
    //cin>>TT;
    while (TT--)
    {
        solve();
    }
    return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:89:9: warning: unused variable ‘cnt’ [-Wunused-variable]
   89 |     int cnt=0;
      |         ^~~

Judge Result