제출 #139398

#제출 시각아이디문제언어결과실행 시간메모리
139398pathKarte (COCI18_karte)C++14
12 / 120
43 ms4604 KiB
#include <bits/stdc++.h> using namespace std; #define f first #define s second #define PI acos(-1.0) typedef unsigned long long int ll; const int N=4e5+5; int n,k,a[N],b[N],lst,tmp,tmp2; vector <int> vec,t,l; int main(){ cin.tie(NULL); ios_base::sync_with_stdio(false); cin>>n>>k; for(int i=0;i<n;i++) cin>>a[i]; sort(a,a+n); for(int i=0;i<n-k;i++) t.push_back(a[i]); for(int i=n-1;i>=n-k;i--) l.push_back(a[i]); lst=0; for(int i=n-k;i<n;i++,lst++) b[lst]=a[i]; for(int i=0;i<n-k;i++,lst++) b[lst]=a[i]; lst=0; for(int i=n-1;i>=0;i--) if(b[i]>lst) lst++; if(lst!=k) cout<<-1<<'\n'; else{ for(int i=0;i<n;i++) cout<<b[i]<<" "; cout<<'\n'; } 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...