#include <iostream>
#include <algorithm>
using namespace std;
#define MAXN 150000
#define MAXK 400
int v[MAXN+MAXK+1];
int sol[MAXN+1];
int main()
{
int n, k;
cin>>n>>k;
int i;
long long sum;
sum=0;
for(i=1; i<=n+k; i++)
{
cin>>v[i];
sum+=v[i];
}
int p, ok, csum, j;
do
{
p=1;
for(j=1; j<=n; j++)
sol[p++]=v[j];
p=n;
csum=sol[j]+sol[p];
p--;
ok=1;
for(j=2; j<=n/2; j++)
{
if(sol[j]+sol[p]==csum)
ok++;
p--;
}
if(ok==n/2)
break;
}
while(next_permutation(v+1, v+n+k+1));
for(i=1; i<=n; i++)
cout<<sol[i]<<" ";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3092 ms |
348 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3044 ms |
604 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3009 ms |
2916 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3007 ms |
348 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3009 ms |
344 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3043 ms |
348 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3044 ms |
348 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3039 ms |
348 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |