Submission #784873

#	Time	Username	Problem	Language	Result	Execution time	Memory
784873		Nanu25	Karte (COCI18_karte)	C++17	0 / 120	121 ms	5396 KiB

karte

#include <iostream>
#include <algorithm>
using namespace std;

const int DIM = 5 * 1e5;

int n, k;
int v[DIM + 5], a[DIM + 5];

int main() {
  cin >> n >> k;
  for(int i = 1; i <= n; i++)
    cin >> v[i];
  
  sort(v + 1, v + n + 1);

  int t = 0;
  for(int i = n; i > n - k; i--)
    a[++t] = v[i];            //pun cele mai mari k numere pe primele pozitii 
  
  for(int i = 1; i <= k; i++)
    a[++t] = v[i];

  int fals = 0, adev = 0;
  for(int i = 1; i <= n; i++) 
    if(a[i] > fals)
      fals++;
  
  adev = n - fals;
  if(adev != k)
    cout << -1;
  else for(int i = 1; i <= n; i++)
    cout << a[i] << " ";

  return 0;
}

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