Submission #64353662

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 <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
/* 降順 */
int cmp(const void* x, const void* y) {
  int a = *(const int*)x, b = *(const int*)y;
  return a > b ? -1 : a < b;
}
int N, M;
int B[212345];
int W[212345];
int64_t Bsum[212345], Wsum[212345];
int main(void) {
  int i;
  int black_last_nn = -1;
  int64_t ans = 0;
  if (scanf("%d%d", &N, &M) != 2) return 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>

/* 降順 */
int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	return a > b ? -1 : a < b;
}

int N, M;
int B[212345];
int W[212345];

int64_t Bsum[212345], Wsum[212345];

int main(void) {
	int i;
	int black_last_nn = -1;
	int64_t ans = 0;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &B[i]) != 1) return 1;
	}
	for (i = 0; i < M; i++) {
		if (scanf("%d", &W[i]) != 1) return 1;
	}
	qsort(B, N, sizeof(*B), cmp);
	qsort(W, M, sizeof(*W), cmp);
	Bsum[0] = B[0];
	if (B[0] >= 0) black_last_nn = 0;
	for (i = 1; i < N; i++) {
		Bsum[i] = Bsum[i - 1] + B[i];
		if (B[i] >= 0) black_last_nn = i;
	}
	Wsum[0] = W[0];
	for (i = 1; i < M; i++) Wsum[i] = Wsum[i - 1] + W[i];
	if (black_last_nn >= 0) ans = Bsum[black_last_nn];
	for (i = 0; i < M && i < N; i++) {
		int bpos = i < black_last_nn ? black_last_nn : i;
		int64_t candidate = Wsum[i] + Bsum[bpos];
		if (candidate > ans) ans = candidate;
	}
	printf("%" PRId64 "\n", ans);
	return 0;
}

/*

白色のボールを選ぶ個数を全探索
黒色のボールは 価値が非負のもの全て or 白色のボールの個数と同じ

*/

Submission Info

Judge Result