백준 5612번: 터널의 입구와 출구

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
 
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int time, current; cin >> time >> current;
 
    int cand = current;
 
    int sol = 0;
    while(time--) {
        int iin, out; cin >> iin >> out;
        cand = cand + iin - out;
        if (cand < 0) {
            sol = -1;
        }
        else {
            sol = max(sol, cand);
        }
    }
    if (sol == -1) {
        sol = 0;
    }
    cout << sol << CENDL;
 
    return 0;
}