제출 #602464

#제출 시각아이디문제언어결과실행 시간메모리
602464starchanKarte (COCI18_karte)C++17
120 / 120
104 ms5212 KiB
#include<bits/stdc++.h> using namespace std; #define in pair<int, int> #define f first #define s second #define pb push_back #define pob pop_back #define INF (int)1e17 #define MX (int)3e5+5 #define fast() ios_base::sync_with_stdio(false); cin.tie(NULL) signed main() { fast(); int n, k; cin >> n >> k; vector<int> a(n+1); a[0] = 0; for(int i = 1; i <= n; i++) cin >> a[i]; sort(a.begin(), a.end()); sort(a.end()-k, a.end(), greater<int>()); bool win = 1; for(int i = 1; i <= n; i++) { if(i <= n-k) win&=(k>=a[i]); else win&=(a[i]>(n-i)); } if(win) { for(int i = 1; i <= n; i++) cout << a[i] << " "; } else cout << "-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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...