fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ms(s,n) memset(s,n,sizeof(s))
  5. #define all(a) a.begin(),a.end()
  6. #define present(t, x) (t.find(x) != t.end())
  7. #define sz(a) int((a).size())
  8. #define FOR(i, a, b) for (int i = (a); i < (b); ++i)
  9. #define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
  10. #define pb push_back
  11. #define pf push_front
  12. #define fi first
  13. #define se second
  14. #define mp make_pair
  15.  
  16. typedef long long ll;
  17. typedef unsigned long long ull;
  18. typedef long double ld;
  19. typedef pair<int,int> pi;
  20. typedef vector<int> vi;
  21. typedef vector<pi> vii;
  22.  
  23. const int MOD = (int) 1e9+7;
  24. const int INF = (int) 1e9+1;
  25. inline ll gcd(ll a,ll b){ll r;while(b){r=a%b;a=b;b=r;}return a;}
  26. inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
  27.  
  28. #define endl "\n"
  29.  
  30. int main(){
  31. #ifndef ONLINE_JUDGE
  32. freopen("input.txt", "r", stdin);
  33. freopen("output.txt", "w", stdout);
  34. #endif
  35. ios::sync_with_stdio(false);
  36. cin.tie(nullptr);
  37. int n, k; cin >> n >> k;
  38. int a[n];
  39. for(int &x : a) cin >> x;
  40. multiset<int> s(a, a + k);
  41. auto it = next(s.begin(), (k - 1) / 2);
  42. for(int i = k ; i < n; i++){
  43. cout << *it << " ";
  44. s.insert(a[i]);
  45. if(a[i] < *it) --it;
  46. if(a[i-k] <= *it) ++it;
  47. s.erase(s.lower_bound(a[i-k]));
  48. }
  49. cout << *it << " ";
  50. return 0;
  51. }
Time limit exceeded #stdin #stdout 5s 5524KB
stdin
Standard input is empty
stdout
Standard output is empty