#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define read freopen("in.txt","r",stdin);freopen("out.txt","w",stdout)
const ll N=1e6+10,M=505,OO=1e16,mod=1e9+7;
int n,k;
ll a[N];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>k;
unordered_map<ll,int>cnt;
for(int i=0;i<n+k;++i){
cin>>a[i];
cnt[a[i]]++;
}
vector<ll>ans;
for(int i=0;i<=k;++i){
for(int j=n+k-1;j>=n-1;--j){
ll sum=a[i]+a[j];
int pairs=0;
vector<ll>cur;
for(int l=0;l<n+k;++l){
if(cnt[sum-a[l]]&&sum-a[l]>a[l]){
cur.push_back(a[l]);
cur.push_back(sum-a[l]);
++pairs;
}
if(pairs==n/2){
ans=cur;
break;
}
}
if(!ans.empty()) break;
}
if(!ans.empty()) break;
}
sort(ans.begin(),ans.end());
for(ll i:ans) cout<<i<<' ';
cout<<"\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
588 KB |
Output is correct |
2 |
Correct |
1 ms |
460 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
1704 KB |
Output is correct |
2 |
Correct |
227 ms |
25936 KB |
Output is correct |
3 |
Correct |
142 ms |
17108 KB |
Output is correct |
4 |
Correct |
139 ms |
17232 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
348 ms |
33744 KB |
Output is correct |
2 |
Correct |
237 ms |
25876 KB |
Output is correct |
3 |
Correct |
536 ms |
47584 KB |
Output is correct |
4 |
Correct |
254 ms |
25912 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
844 KB |
Output is correct |
2 |
Correct |
210 ms |
24040 KB |
Output is correct |
3 |
Correct |
3 ms |
1100 KB |
Output is correct |
4 |
Correct |
271 ms |
27920 KB |
Output is correct |
5 |
Correct |
3 ms |
1100 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
30 ms |
9932 KB |
Output is correct |
3 |
Correct |
11 ms |
2544 KB |
Output is correct |
4 |
Correct |
84 ms |
12460 KB |
Output is correct |
5 |
Correct |
7 ms |
2600 KB |
Output is correct |
6 |
Correct |
5 ms |
1228 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
3063 ms |
225924 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
30 ms |
6968 KB |
Output is correct |
2 |
Execution timed out |
3085 ms |
225576 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |