Submission #63559767

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<string>
#include<vector>
#include<algorithm>
int main()
{
    int n, m;
    std::cin >> n >> m;
    std::vector<int> black(n);
    for (int i = 0; i < n; i++) {
        std::cin >> black[i];
    }
    std::vector<int> white(m);
    for (int i = 0; i < m; i++) {
        std::cin >> white[i];
    }
    std::sort(black.begin(), black.end(), std::greater<int>{});
    std::sort(white.begin(), white.end(), std::greater<int>{});
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
//#include<string>
#include<vector>
#include<algorithm>

int main()
{
    int n, m;
    std::cin >> n >> m;
    std::vector<int> black(n);
    for (int i = 0; i < n; i++) {
        std::cin >> black[i];
    }
    std::vector<int> white(m);
    for (int i = 0; i < m; i++) {
        std::cin >> white[i];
    }

    std::sort(black.begin(), black.end(), std::greater<int>{});
    std::sort(white.begin(), white.end(), std::greater<int>{});

    int max_val = 0;
    int i;
    for (i = 0; i < std::min(n, m); i++) {
        if ((black[i] + white[i] >= 0) && (black[i] + white[i] >= black[i])) {
            max_val += black[i] + white[i];
        } else {
            break;
        }
    }
    int j;
    for (j = i; j < n; j++) {
        if (black[j] >= 0) {
            max_val += black[j];
        } else {
            break;
        }
    }

    std::cout << max_val << std::endl;

    return 0;
}

Submission Info

Judge Result