Submission #63519117

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<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+5;
int n,m,maxn,ans;
int a[N],b[N],mark[N];
bool cmp(int a,int b){return a>b;};
signed main(){
  cin>>n>>m;
  for(int i=1;i<=n;i++) cin>>a[i];
  for(int i=1;i<=m;i++) cin>>b[i];
  sort(a+1,a+n+1,cmp);sort(b+1,b+m+1,cmp);
  for(int i=1;i<=n&&i<=m;i++){
    if(a[i]+b[i]>0){
      if(a[i]&&b[i]<0) continue;
      ans+=a[i]+b[i];
      mark[i]=1;
    }
  }
  for(int i=1;i<=n;i++){
    if(!mark[i]&&a[i]>0){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+5;
int n,m,maxn,ans;
int a[N],b[N],mark[N];
bool cmp(int a,int b){return a>b;};
signed main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=m;i++) cin>>b[i];
	sort(a+1,a+n+1,cmp);sort(b+1,b+m+1,cmp);
	for(int i=1;i<=n&&i<=m;i++){
		if(a[i]+b[i]>0){
			if(a[i]&&b[i]<0) continue;
			ans+=a[i]+b[i];
			mark[i]=1;
		}
	}
	for(int i=1;i<=n;i++){
		if(!mark[i]&&a[i]>0){
			ans+=a[i];
		}
	}
	if(ans) cout<<ans;
	else cout<<maxn;
}

Submission Info

Judge Result