Submission #237535

#TimeUsernameProblemLanguageResultExecution timeMemory
237535NONAMEKarte (COCI18_karte)C++17
0 / 120
1097 ms2296 KiB
#include <bits/stdc++.h> #define sz(x) int(x.size()) #define pb push_back #define mp make_pair #define ft first #define sd second #define el '\n' using namespace std; typedef long long ll; const int N = 5e5 + 10; int n, k, a[N]; bool gd(int x) { int cur = 0; for (int j = 0; j < n; j++) if (a[(j + x) % n] > cur) cur++; return cur == k; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; for (int i = 0; i < n; ++i) cin >> a[i]; sort(a, a + n); for (int i = 0; i < n; ++i) if (gd(i)) { for (int j = 0; j < n; ++j) cout << a[(i + j) % n] << ' '; return 0; } cout << -1; }
#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...