Cod sursa(job #1752085)
| Utilizator | Data | 2 septembrie 2016 18:50:53 | |
|---|---|---|---|
| Problema | Deque | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<bits/stdc++.h>
#define in f
#define out g
#define maxx 5000010
using namespace std;
ifstream f ("deque.in");
ofstream g ("deque.out");
int n;
int k;
long long s;
int v[maxx];
set<int>setu;
int main() {
in >> n;
in >> k;
for(int i = 0; i < n; i++) {
in >> v[i];
setu.insert(v[i]);
if(setu.size() == k) {
s = s + *setu.begin();
setu.erase(v[i - k + 1]);
}
}
out << s;
}
