Submission #63553339

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
bool cmp(int a,int b){
  return  a>b;
}
const int N=2e5+10;
int b[N];
int w[N];
int main(){
  int n,m;
  cin>>n>>m;
  long long sumb=0;
  long long sumw=0;
  for(int i=1;i<=n;i++){
    cin>>b[i];
    if(b[i]>0){
      sumb+=b[i];
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
bool cmp(int a,int b){
	return  a>b;
}
const int N=2e5+10;
int b[N];
int w[N];
int main(){
	int n,m;
	cin>>n>>m;
	long long sumb=0;
	long long sumw=0;
	for(int i=1;i<=n;i++){
		cin>>b[i];
		if(b[i]>0){
			sumb+=b[i];
		}
	}
	for(int i=1;i<=m;i++){
		cin>>w[i];
		if(w[i]>0){
			sumw+=w[i];
		}
	}
	sort(b+1,b+1+n,cmp);
	sort(w+1,w+1+m,cmp);
	sumb-=b[1];
	sumw-=w[1];
	long long ans=0;
	for(int i=1;i<=min(n,m);i++){
		if(b[i]>0){
			ans+=b[i];
		}
		else{
			if(abs(b[i])<w[i]){
				ans+=b[i];
			}
			else{
				continue;
			}
		}
		if(w[i]>0){
			ans+=w[i];
		}
	}
	cout<<ans;
	return 0;
}

Submission Info

Judge Result