Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main()
- {
- multiset<int> col;
- queue<int> fila;
- int val, i, j, n, k, cases, greatest;
- scanf("%d", &cases);
- for(j = 0; j < cases; j++)
- {
- col.clear();
- while(!fila.empty())
- fila.pop();
- scanf("%d %d", &n, &k);
- for(i = 0; i < k; i++)
- {
- scanf("%d", &val);
- col.insert(val);
- fila.push(val);
- }
- for(i = k; i < n; i++)
- {
- greatest = *(col.rbegin());
- printf("%d ", greatest);
- scanf("%d", &val);
- col.insert(val);
- fila.push(val);
- col.erase(fila.front());
- fila.pop();
- }
- greatest = *(col.rbegin());
- printf("%d ", greatest);
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement