Submission #48659252

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<map>
#include<set>
#include<numeric>
#include<vector>
#include<algorithm>
#include<queue>
#include<tuple>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
typedef pair<int,P> PP;
const ll INF=1LL<<60;
const int inf=1<<30;
int main(){
    int N,K;
    cin>>N>>K;
    vector<int> p(N);
    for(int i=0;i<N;i++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<map>
#include<set>
#include<numeric>
#include<vector>
#include<algorithm>
#include<queue>
#include<tuple>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
typedef pair<int,P> PP;
const ll INF=1LL<<60;
const int inf=1<<30;


int main(){
    int N,K;
    cin>>N>>K;
    vector<int> p(N);
    for(int i=0;i<N;i++){
        cin>>p[i];
    }   

    /*
    seg木
    */


    //
    multiset<int> mst;
    //i=0,1,2,..,K-1
    for(int i=0;i<K;i++){
        mst.insert(p[i]);
    }   
    vector<int> ans;
    //mstの大きさがK

    ans.push_back(*mst.begin());//K番目に大きいので,最小

    for(int i=K;i<N;i++){
        
        int v=*mst.begin();
        if(p[i]>v){
            mst.erase(mst.find(v));
            mst.insert(p[i]);
        }
        ans.push_back(*mst.begin());
    }

    for(int v:ans){
        cout<<v<<endl;
    }


}

Submission Info

Judge Result