Submission #373954

#TimeUsernameProblemLanguageResultExecution timeMemory
373954ritul_kr_singhKarte (COCI18_karte)C++17
120 / 120
130 ms13792 KiB
//#pragma GCC optimize("Ofast,unroll-loops") #include <bits/stdc++.h> using namespace std; #define int long long #define sp << " " << #define nl << "\n" signed main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; int a[n]; for(int &i : a) cin >> i; sort(a, a+n); vector<int> ans; for(int i=n-k; i<n; ++i) ans.push_back(a[i]); for(int i=0; i<n-k; ++i) ans.push_back(a[i]); bool ok = true; int prev = 0; for(int i=0; i<n; ++i){ if(i<k){ if(ans[i]<=prev) ok = false; ++prev; }else{ if(ans[i]>k) ok = false; } } reverse(ans.begin(), ans.end()); if(ok){ for(int i : ans) cout << i << ' '; }else 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...