Submission #844691

# Submission time Handle Problem Language Result Execution time Memory
844691 2023-09-05T17:05:46 Z lto5 Studentsko (COCI14_studentsko) C++17
100 / 100
2 ms 604 KB
#include <bits/stdc++.h>

using namespace std;

int p[5005];

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  vector<pair<int, int>> a;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    a.emplace_back(x, i);
  }
  sort(a.begin(), a.end());
  for (int i = 0; i < n; i++) {
    p[a[i].second] = i / k;
  }
  multiset<int> s;
  int ans = 1;
  for (int i = 0; i < n; i++) {
    auto it = s.upper_bound(p[i]);
    if (it != s.end()) s.erase(it);
    s.emplace(p[i]);
    ans = max<int>(ans, s.size());
  }
  cout << n - ans;
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct