This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  int n, k;
  string s;
  cin >> n >> k >> s;
  stack<pair<int, int>> st;
  for (int i = 1; i <= n; i++) {
    if (!st.empty()) {
      if (st.top().first == s[i - 1]) {
        st.push({s[i - 1], st.top().second + 1});
      } else {
        st.push({s[i - 1], 1});
      }
    } else {
      st.push({s[i - 1], 1});
    }
    if (st.top().second == k) {
      int cnt = 0;
      while (cnt < k) {
        st.pop();
        cnt++;
      }
    }
  }
  string ret = "";
  while (!st.empty()) {
    ret += st.top().first;
    st.pop();
  }
  reverse(ret.begin(), ret.end());
  cout << ret;
  return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |