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>
#pragma GCC optimize("unroll-loops")
using namespace std;
int n,k,a[150500];
int sol[150005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
for (int i = 1; i <= n + k; i++)
cin >> a[i];
sort(a + 1,a + n + k + 1);
for (int i = 1; i <= k + 1; i++)
{
for (int j = n + k; j >= n - 1; j--)
{
int sum = a[i] + a[j];
int st = i + 1,dr = j - 1;
int sz = 3;
sol[1] = a[i];
sol[2] = a[j];
while (st < dr and sz <= n)
{
if (a[st] + a[dr] == sum)
{
sol[sz++] = a[st];
sol[sz++] = a[dr];
st++;
dr--;
}
else if (a[st] + a[dr] > sum)
dr--;
else
st++;
}
if (sz == n + 1)
{
sort(sol + 1,sol + n + 1);
for (int j = 1; j <= n; j++)
cout << sol[j] << ' ';
return 0;
}
}
}
return 0;
}
# | 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... |