Submission #580129

# Submission time Handle Problem Language Result Execution time Memory
580129 2022-06-20T15:54:21 Z MrM7md Karte (COCI18_karte) C++17
12 / 120
114 ms 10704 KB
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define endl "\n"

const int MOD = 1e9 + 7;

int frq[1000050];
signed main(){
   ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
   int n,k;
   cin >> n >> k;
   pair<int,char> a[n];
   for(int i=0;i<n;i++)cin>>a[i].first;
   sort(a,a+n);
   int f=0;
   for(int i=0;i<n;i++){
      if(f<a[i].first){
         f++;
         a[i].second='f';
      }
      else{
         a[i].second='t';
      }
   }
   if(f==k){
      for(int i=n-1;i>=0;i--){
         cout<<a[i].first<<' ';
      }
   }
   else if(f<k){
      cout<<-1;
   }
   else{
      for(int i=0;i<n;i++){
         cout<<a[i].first<<' ';
      }
   }

}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 2376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 4428 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 114 ms 10704 KB Output isn't correct
2 Halted 0 ms 0 KB -