#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N=2e5+5,mod=1e9+7;
int t,n,k,F;
vector<int >v,ans;
int a[N];
int main(){
cin>>n>>k;
for(int i=1;i<=n+k;i++){
cin>>a[i];
}
for(int f=0;f<=k;f++){
for(int s=0;s<=k-f;s++){
int lft=k-s-f;
v.clear();
int l=f+1;
int r=n+k-s;
int sum=a[l]+a[r];
while(l<r) {
if(a[l]+a[r]==sum) v.push_back(a[l]),v.push_back(a[r]),l++,r--;
else if(a[l]+a[r]>sum) r--,lft--;
else l++,lft--;
}
if(v.size()>=n && lft>=0) {
for(int i=0;i<n;i++){
ans.push_back(v[i]);
}
sort(ans.begin(),ans.end());
for(int i=0;i<n;i++){
cout<<ans[i]<<endl;
}
return 0;
F=1;
}
}
}
for(int i=0;i<n;i++){
cout<<25<<endl;
}
}
Compilation message
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:26:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
26 | if(v.size()>=n && lft>=0) {
| ~~~~~~~~^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
364 KB |
Output is correct |
2 |
Correct |
6 ms |
364 KB |
Output is correct |
3 |
Correct |
6 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
56 ms |
1004 KB |
Output is correct |
2 |
Correct |
411 ms |
4836 KB |
Output is correct |
3 |
Correct |
405 ms |
4708 KB |
Output is correct |
4 |
Correct |
404 ms |
4708 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
405 ms |
3812 KB |
Output is correct |
2 |
Correct |
405 ms |
4964 KB |
Output is correct |
3 |
Correct |
408 ms |
4708 KB |
Output is correct |
4 |
Correct |
405 ms |
4836 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
2 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
2 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
8 ms |
364 KB |
Output is correct |
3 |
Correct |
6 ms |
364 KB |
Output is correct |
4 |
Correct |
6 ms |
364 KB |
Output is correct |
5 |
Correct |
6 ms |
364 KB |
Output is correct |
6 |
Correct |
7 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
553 ms |
4708 KB |
Output is correct |
3 |
Correct |
410 ms |
4896 KB |
Output is correct |
4 |
Correct |
436 ms |
4836 KB |
Output is correct |
5 |
Correct |
404 ms |
4828 KB |
Output is correct |
6 |
Correct |
416 ms |
4964 KB |
Output is correct |
7 |
Correct |
434 ms |
4708 KB |
Output is correct |
8 |
Correct |
407 ms |
4708 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Execution timed out |
3071 ms |
1900 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |