Submission #1256373

#TimeUsernameProblemLanguageResultExecution timeMemory
1256373aegKarte (COCI18_karte)C++20
12 / 120
65 ms6756 KiB
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0)->sync_with_stdio(0); int n, k; cin >> n >> k; vector<int> a(n); for(auto&x:a) cin >> x; sort(a.begin(), a.end()); vector<int> b(n); for (int i = n - k; i < n; i++) { b[i - n + k] = a[i]; } for (int i = 0; i < n - k; i++) { b[i + k] = a[i]; } int falsecnt = 0; for (int i = 0; i < n; i++) { if (b[i] > falsecnt) { falsecnt++; } } if(falsecnt != k) cout << "-1\n"; else { copy(b.begin(), b.end(), ostream_iterator<int>(cout, " ")); 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...