Submission #549679

#TimeUsernameProblemLanguageResultExecution timeMemory
549679SlyGaleebTable Tennis (info1cup20_tabletennis)C++17
0 / 100
3079 ms15784 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define ld long double #define vf v[i].first #define vs v[i].second const ll MOD = 1e9 + 7; void print(vector<int> &v) { for (auto c:v) cout << c << " "; cout << "\n"; } map<pair<int,int>,int>mp1; map<pair<int,int>,int>mp2; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n,k; ll a; cin >> n >> k; multiset<ll>v,temp; for (int i = 0; i < n+k; ++i) { cin >> a; v.insert(a); } temp = v; for (auto it = temp.begin(); it != temp.end(); ++it) { bool flag = true; temp.erase(it); auto d = (--temp.end()); ll sum = *temp.begin()+*d; d--; for (auto c = ++temp.begin(); c != --temp.end(); ++c) { if (*c+*d!=sum) { flag = false; break; } d--; } if (flag) break; temp = v; } for (auto c:temp) cout << c << " "; }
#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...