Submission #237551

#TimeUsernameProblemLanguageResultExecution timeMemory
237551NONAMEKarte (COCI18_karte)C++17
24 / 120
142 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]; int f(int x) { int cur = 0; for (int i = 0; i < n; i++) if (a[(i + x) % n] > cur) cur++; return cur; } 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); int l = 0, r = n - 1; while (l < r) { int md = (l + r) >> 1; if (f(md) >= k) r = md; else l = md + 1; } if (f(l) == k) { for (int j = n - 1; j >= 0; --j) cout << a[(l + 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...