Submission #1145304

#TimeUsernameProblemLanguageResultExecution timeMemory
1145304MuhammetTable Tennis (info1cup20_tabletennis)C++20
100 / 100
256 ms3948 KiB
#include "bits/stdc++.h" using namespace std; #define ll long long int n, k; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> k; vector <int> a(n+k+1); for(int i = 1; i <= n+k; i++){ cin >> a[i]; } for(int i1 = 1; i1 <= k+1; i1++){ for(int j1 = n+k; j1 >= n-1; j1--){ if(i1 == j1) continue; int s = a[i1] + a[j1]; int l = 1, r = n+k, cnt = 0; vector <int> v; while(l < r){ if(a[l] + a[r] < s){ l++; cnt++; } else if(a[l] + a[r] > s){ r--; cnt++; } else { v.push_back(a[l++]); v.push_back(a[r--]); } if(cnt > k) break; } if((int)v.size() == n){ sort(v.begin(), v.end()); for(auto i : v){ cout << i << ' '; } return 0; } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...