제출 #745959

#제출 시각아이디문제언어결과실행 시간메모리
745959vjudge1Table Tennis (info1cup20_tabletennis)C++17
0 / 100
65 ms2004 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main(){ int n, k; cin >> n >> k; vector <ll> v(n+k); for(ll x : v){ cin >> x; } sort(v.begin(),v.end()); int f = 0; for(int i = 0; i < n; i++){ if(v[i] + v[n-i-1] != v[0] + v[n-1]) f = 1; } if(f == 1){ for(int i = 0; i < n; i++){ cout << v[i] << " "; } }else{ for(int i = 0; i < n; i++){ cout << v[i+1] << " "; } } }
#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...