# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717344 | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3078 ms | 1048576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int ll
typedef long long ll;
using namespace std;
const int N = 15e4 + 10, mod = 1e9 + 7;
int n, k, a[N];
map<int, vector<pair<int, int> > > vis;
signed main() {
FAST;
cin >> n >> k;
set<int> s;
for(int i = 0; i < n + k; i++) cin >> a[i];
for(int i = 0; i < n + k - 1; i++) {
for(int j = i + 1; j < n + k; j++) {
vis[a[i] + a[j]].push_back({a[i], a[j]});
s.insert(a[i] + a[j]);
}
}
int cur = 0, num = 0;
for(auto it : s) {
if(vis[it].size() > cur) {
cur = vis[it].size();
num = it;
}
}
vector<int> v;
int i = 0;
while(v.size() < n && i < vis[num].size()) {
v.push_back(vis[num][i].first);
v.push_back(vis[num][i].second);
i++;
}
sort(v.begin(), v.end());
for(auto it : v) {
cout << it << ' ';
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |