제출 #1160996

#제출 시각아이디문제언어결과실행 시간메모리
1160996trufanov.pKarte (COCI18_karte)C++20
120 / 120
67 ms6872 KiB
#include <iostream> #include <vector> #include <algorithm> #include <cstring> #include <cctype> #include <string> #include <queue> #include <unordered_set> #include <deque> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } sort(a.begin(), a.end()); vector<int> ans; for (int i = n - k; i < n; ++i) { ans.push_back(a[i]); } for (int i = 0; i < n - k; ++i) { ans.push_back(a[i]); } int wrong = 0; for (int i = 0; i < n; ++i) { if (ans[i] > wrong) { wrong++; } } if (wrong != k) { cout << -1 << '\n'; return 0; } reverse(ans.begin(), ans.end()); for (int i : ans) { cout << i << ' '; } }
#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...