Cod sursa(job #1791329)
Utilizator | Data | 29 octombrie 2016 11:37:32 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
multiset <long long> s;
long long n,k,a[1000007],t,c;
int main()
{
ifstream in("deque.in");
ofstream out("deque.out");
in >> n >> k;
for(int i=1;i<=n;i++) in >> a[i];
for(int i=1;i<=k;i++) s.insert(a[i]);
auto it=s.begin();
t+=*it;
for(int i=k+1;i<=n;i++){
s.erase(a[i-k]);
s.insert(a[i]);
for(it=s.begin();it!=s.end();it++) cout << *it << ' ';
//cout << '\n';
it=s.begin();
t+=*it;
}
out << t;
}