求调闭关qwq

#include<iostream>
#include<algorithm>
#define maxn 200005
using namespace std;
int n;
struct sold{
    int id;
    int b_c;
}s[maxn];
bool cmp(sold x,sold y){
    return x.b_c>y.b_c;
}
int b[maxn];
int c[maxn];
long long n2=n*2;
int main(){
    cin>>n;
    for(int i=1;i<=n2;i++){
        cin>>b[i];
    }
    for(int i=1;i<=n2;i++){
        cin>>c[i];
    }
    for(int i=1;i<=n2;i++){
        s[i].id=i;
        s[i].b_c=b[i]-c[i];
    }
    sort(s+1,s+n2+1,cmp);
    int ans=0;
    for(int i=1;i<=n2;i++){
        int t=s[i].id;
        if(i<=n){
            ans+=b[t];
        }
        else ans+=c[t];
        
    }
    cout<<ans;
    
}