Submission #1319807

#TimeUsernameProblemLanguageResultExecution timeMemory
1319807lernTable Tennis (info1cup20_tabletennis)C++20
0 / 100
3093 ms1516 KiB
#include <bits/stdc++.h> using namespace std; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n,k; cin>>n>>k; int a[n + k]; for (int i = 0; i < n + k; i++) { cin>>a[i]; } if(n == 2){ if(a[0] == a[1]) cout<<a[0]<< " " << a[1]; if(a[1] == a[2]) cout<<a[1]<< " " << a[2]; if(a[0] == a[2]) cout<<a[0]<< " " << a[2]; return 0; } for (int i = -1; i < n; i++) { if(i > -1) swap(a[i], a[n + k - 1]); int b[n]; for (int j = 0; j < n; j++) { b[j] = a[j]; } sort(b, b + n); int ans1 = 0, ans2 = 0, l = 0, r = n - 1, cnt = 0; while(l < r){ if(cnt % 2 ==0) ans1 += (b[l] + b[r]); else ans2 += (b[l] + b[r]); l++; r--; cnt ++; } if(ans1 == ans2){ for (int j = 0; j < n; j++) { std::cout << a[j] << " "; } return 0; } if(i > -1) swap(a[i], a[n + k - 1]); } 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...