백준 10025번 게으른 백곰 C++

https://www.acmicpc.net/problem/10025

10025번: 게으른 백곰

 

슬라이딩 윈도우

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

vector<int> v(1000001, 0);

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n, k;
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        int g, x;
        cin >> g >> x;
        v[x] = g;
    }
    int left = 0;
    int right = k * 2;
    int sum = 0;
    int ans = 0;
    for (int i = left; i <= right; i++) {
        if (i >= v.size()) break;
        sum += v[i];
    }
    ans = sum;
    for (int i = 0; i <= v.size(); i++) {
        if (right + 1 >= v.size()) break;
        sum -= v[left++];
        sum += v[++right];
        ans = max(ans, sum);
    }
    cout << ans;
}