Submission #551946

#	Time	Username	Problem	Language	Result	Execution time	Memory
551946		colossal_pepe	Table Tennis (info1cup20_tabletennis)	C++17	87 / 100	3065 ms	3840 KiB

tabletennis

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n, m;
vector<int> v;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    v.resize(n + m);
    for (int i = 0; i < n + m; i++) {
        cin >> v[i];
    }
    bool done = 0;
    for (int i = 0; i <= m + 1; i++) {
        for (int j = n + m - 1; j >= max(i + 1, n - 1); j--) {
            int total = v[i] + v[j];
            int cnt = 0;
            for (int k = 0; k < n + m; k++) {
                if (binary_search(v.begin(), v.end(), total - v[k])) cnt++;
            }
            if (cnt >= n) {
                cnt = n;
                for (int k = 0; k < n + k; k++) {
                    if (not cnt) break;
                    if (binary_search(v.begin(), v.end(), total - v[k])) {
                        cout << v[k] << ' ';
                        cnt--;
                    }
                }
                cout << '\n';
                done = 1;
                break;
            }
        }
        if (done) break;
    }
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 15 / 15
• Subtask 8: 0 / 13