제출 #1258086

#제출 시각아이디문제언어결과실행 시간메모리
1258086XXBabaProBerkayKarte (COCI18_karte)C++20
120 / 120
66 ms4932 KiB
#include <bits/stdc++.h> using namespace std; template<class T> using vec = vector<T>; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int N, K; cin >> N >> K; vec<int> A(N); for (int &i : A) cin >> i; sort(A.begin(), A.end()); int cnt = 0; for (int i = N - K; i < N; i++) { if (A[i] <= cnt) { cout << "-1\n"; return 0; } cnt++; } for (int i = N - K - 1; i >= 0; i--) if (A[i] > cnt) { cout << "-1\n"; return 0; } for (int i = 0; i < N - K; i++) cout << A[i] << ' '; for (int i = N - 1; i >= N - K; i--) cout << A[i] << ' '; cout << '\n'; }
#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...