Submission #28413016

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

int main(){

    int K, N, p, a = 0;
    vector<int> A;
    cin >> N >> K;
    for (int i=0; i<N; i++){
        cin >> p;

        if (i < K-1) {
            A.push_back(p);
        } else if (i == K-1){
            A.push_back(p);
            sort(A.begin(), A.end(), greater<int>());
            a = A[K-1];
            cout << A[K-1] << endl;
        } else {
            if (p < a) {
                cout << a << endl;
            } else if (a == N-K+1) {
                cout << a << endl;
            } else {
                A.push_back(p);
                sort(A.begin(), A.end(), greater<int>());
                a = A[K-1];
                cout << A[K-1] << endl;
            }
        }
    }
    return 0;
}

Submission Info

Judge Result