Submission #63556854

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>
using namespace std;
#define int long long
const int N = 2e5+10;
int b[N],w[N],s[N];
bool cmp(int x,int y){
  return x>y;
}
signed main(){
//  freopen("abc.in","r",stdin);
//  freopen("abc.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n,m;
  cin>>n>>m;
  for(int i = 1;i<=n;i++){
     cin>>b[i];
  } 
  for(int j = 1;j<=m;j++) cin>>w[j];
  sort(b+1,b+n+1,cmp);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5+10;
int b[N],w[N],s[N];
bool cmp(int x,int y){
	return x>y;
}
signed main(){
//	freopen("abc.in","r",stdin);
//	freopen("abc.out","w",stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,m;
	cin>>n>>m;
	for(int i = 1;i<=n;i++){
		 cin>>b[i];
	} 
	for(int j = 1;j<=m;j++) cin>>w[j];
	sort(b+1,b+n+1,cmp);
	sort(w+1,w+m+1,cmp);
	for(int i = 1;i<=m;i++){
		s[i] = s[i-1]+w[i];
	}
	int mx = 0;
	for(int j = 1;j<=n;j++){
		if(b[j]>=0) mx+=b[j];
	}
	int maxn = 0;
	for(int i = 1;i<=m;i++){
		maxn = max(maxn,s[i]+mx);
	}
	cout<<maxn<<endl;
	
	return 0;
}

Submission Info

Judge Result