Submission #237524

#TimeUsernameProblemLanguageResultExecution timeMemory
237524VEGAnnKarte (COCI18_karte)C++14
84 / 120
1092 ms1912 KiB
#include <bits/stdc++.h> #define PB push_back #define sz(x) ((int)x.size()) using namespace std; typedef long long ll; const int N = 200100; int n, k, a[N], b[N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); #ifdef _LOCAL freopen("in.txt","r",stdin); #endif // _LOCAL cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); for (int kl = 0; kl <= n; kl++){ for (int i = n - kl, j = 0; i < n; i++, j++) b[j] = a[i]; for (int i = 0, j = kl; i < n - kl; i++, j++) b[j] = a[i]; int cnt = 0; for (int i = 0; i < n; i++) if (b[i] > cnt) cnt++; if (cnt == k){ for (int i = n - 1; i >= 0; i--) cout << b[i] << " "; return 0; } } cout << -1; return 0; }
#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...