Submission #734622

#TimeUsernameProblemLanguageResultExecution timeMemory
734622JellyTheOctopusKarte (COCI18_karte)C++17
12 / 120
164 ms2260 KiB
#include <bits/stdc++.h> using namespace std; int N, K; vector<int> arr; bool check() { int numLies = 0; for (int i = N-1; i >= 0; i--) { if (numLies < arr[i]) { numLies++; } } return numLies == K; } int main() { cin >> N >> K; arr.resize(N); for (int i = 0; i < N; i++) { cin >> arr[i]; } sort(arr.begin(), arr.end()); rotate(arr.begin(), arr.begin()+(K % N), arr.end()); if (check()) { for (auto v: arr) { cout << v << " "; } cout << "\n"; } else { cout << -1 << "\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...