제출 #366037

#제출 시각아이디문제언어결과실행 시간메모리
366037sobaTable Tennis (info1cup20_tabletennis)C++14
34 / 100
253 ms30828 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n , k; cin >> n >> k ; ll teams=n/2; vector<ll>v; ll x; n+=k; map<ll,ll>mp , occ; for(int i = 0 ; i < n ; i++) { cin >> x; mp[x]++; v.push_back(x); } sort(v.begin(), v.end()); vector<ll>poten; set<ll>ss; for(int i = 0 ; i< 2*k ; i++) { for( int j = n-1; j >= n-(2*k) ; j-- ) { ss.insert(v[i]+v[j]); occ[v[i]+v[j]]++; } } for(ll u : ss) { if(occ[u]>=k) { poten.push_back(u); } } vector<ll>ansa; ll sz=poten.size() , cnt; for( int i = 0 ; i < sz ; i++) { ansa.clear(); ll tmp=teams; cnt=0; for(int j = 0 ; v[j]<(poten[i]/2) ; j++ ) { if(poten[i]-v[j]==v[j])continue; if(mp[poten[i]-v[j]]) { tmp--; ansa.push_back(poten[i]-v[j]); ansa.push_back(v[j]); } else cnt++; if(tmp==0) break; if(cnt==k+1) break; } if(tmp==0) { break; } } sort( ansa.begin() , ansa.end()); for(int i = 0 ; i < teams*2 ; i++) { cout << ansa[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...