# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118549 | ElayV13 | Table Tennis (info1cup20_tabletennis) | C++17 | 3104 ms | 491948 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>
using namespace std;
#define int long long
#define ld double
const int INF = 1e18;
const int mod = 12345;
const int sz = 1e6 + 5;
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
int n , k;
cin >> n >> k;
vector < int > a(n + k);
for(int i = 0;i < n + k;i++) cin >> a[i];
sort(a.begin() , a.end());
int ls = (n / 2);
map < int , int > m;
int pos = -1;
for(int i = 0;i < n + k - 1;i++)
{
bool f = 0;
for(int j = i + 1;j < n + k;j++)
{
m[a[i] + a[j]]++;
if(m[a[i] + a[j]] == ls)
{
f = 1;
pos = a[i] + a[j];
break;
}
}
if(f) break;
}
vector < pair < int , int > > ans;
for(int i = 0;i < n;i++)
{
if(ans.size() == n / 2) break;
if(m[pos - a[i]] > 0) ans.push_back({a[i] , pos - a[i]});
}
for(int i = 0;i < ans.size();i++) cout << ans[i].first << ' ' << ans[i].second << ' ';
}
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... |