Submission #497697

#TimeUsernameProblemLanguageResultExecution timeMemory
497697LouayFarahKarte (COCI18_karte)C++17
120 / 120
122 ms17888 KiB
#include "bits/stdc++.h" using namespace std; #define endl "\n" #define ll long long int #define pb push_back #define mp make_pair #define fi first #define se second const long long MOD = 1e9+7; const long long INF = 1e18; int nx[4] = {0, 0, -1, 1}; int ny[4] = {1, -1, 0, 0}; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n, k; cin >> n >> k; vector<ll> arr(n, 0); for(int i = 0; i<n; i++) { cin >> arr[i]; } sort(arr.begin(), arr.end()); stack<ll> res; for(int i = n-k; i<n; i++) { res.push(arr[i]); } for(int i = 0; i<n-k; i++) { res.push(arr[i]); } vector<ll> v; while(!res.empty()) { v.pb(res.top()); res.pop(); } ll f = 0; for(int i = n-1; i>=0; i--) { if(v[i]>f) { f++; } } if(f==k) { for(auto elt: v) cout << elt << ' '; cout << endl; } else { cout << -1 << endl; } 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...