Submission #602452

#TimeUsernameProblemLanguageResultExecution timeMemory
602452starchanKarte (COCI18_karte)C++17
12 / 120
102 ms11080 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define in pair<int, int> #define f first #define s second #define pb push_back #define pob pop_back #define INF (int)1e17 #define MX (int)3e5+5 #define fast() ios_base::sync_with_stdio(false); cin.tie(NULL) signed main() { fast(); int n, k; cin >> n >> k; vector<in> a(n+1); a[0] = {0,0}; for(int i = 1; i <= n; i++) { cin >> a[i].f; a[i].s = i; } sort(a.begin(), a.end()); bool win = 1; for(int i = 1; i <= n; i++) { if(i <= n-k) win&=(k>=a[i].f); else win&=(a[i].f>(n-i)); } if(win) { for(int i = 1; i <= n; i++) cout << a[i].f << " "; } else 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...