Submission #91038

#	Time	Username	Problem	Language	Result	Execution time	Memory
91038		sjhuang26	Karte (COCI18_karte)	C++14	120 / 120	211 ms	13928 KiB

karte

#include<iostream>
#include<algorithm>
int N,K,a[500000],ans[500000];
using namespace std;
int main(){
  cin>>N>>K;
  for(int i=0;i<N;++i)cin>>a[i];
  sort(a,a+N);
  int b=0;
  while(b!=N&&a[b]<=K)++b;
  if(N-b>K){
    cout<<-1<<'\n';
  }else{
    int j=N-1,k=K;
    for(int i=N-K;i<N;++i){
      if(a[j]<k){
        cout<<-1<<'\n';return 0;
      }else{
        ans[i]=a[j];
        --j;--k;
      }
    }
    for(int i=0;i<N-K;++i){
      ans[i]=a[j];
      --j;
    }
    for(int i=0;i<N;++i){
      cout<<ans[i];if(i!=N-1)cout<<' ';
    }
    cout<<'\n';
  }
  return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12