oj.uz

Submission #785785

# Submission time Handle Problem Language Result Execution time Memory
785785 2023-07-17T15:23:21 Z Nanu25 Karte (COCI18_karte) C++17
120 / 120
 148 ms 6688 KB 
#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 - k; i >= 1; i--)
    a[++t] = v[i];      //le pun pe cele mai mici pe primele pozitii caci pot fii adevarate;

  for(int i = n; i > n - k; i--)
    a[++t] = v[i];            //pun cele mai mari k numere pe ultimele pozitii pentru ca sunt singurele care pot fii false;
  
  int fals = 0;
  for(int i = n; i >= 1; i--) 
    if(a[i] > fals)
      fals++;

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

  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 264 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1564 KB Output is correct
2 Correct 24 ms 1092 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 2868 KB Output is correct
2 Correct 48 ms 1740 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 6688 KB Output is correct
2 Correct 118 ms 4160 KB Output is correct