제출 #530210

#제출 시각아이디문제언어결과실행 시간메모리
530210Jean7Table Tennis (info1cup20_tabletennis)C++14
11 / 100
3060 ms5736 KiB
#include <bits/stdc++.h> #define fastio ios::sync_with_stdio(0),cin.tie(0),cout.tie(0) #define int long long using namespace std ; vector <int> v ; bool check () { set <int> st ; int n = v.size() ; for ( int i = 0 ; i < n ; i++ ) st.insert(v[i]+v[n-i-1]) ; if ( st.size() == 1 ) return 1 ; return 0 ; } signed main () { fastio ; int n , k ; cin >> n >> k ; int a[n+k] ; for ( auto &it : a ) cin >> it ; sort ( a , a + n ) ; for ( int i = 0 ; i < n+k ; i++ ) { for ( int j = 0 ; j < n+k ; j++ ) if ( j != i ) v.push_back(a[j]) ; if ( check () ) { for ( int j = 0 ; j < n+k ; j++ ) if ( j != i ) cout << a[j] << " " ; return 0 ; } v.clear() ; } 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...