提出 #60505034

---

ソースコード 拡げる

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <bitset>
#include <cctype>
#include <functional>
#include <cassert>
using namespace std;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)

using ll = long long;
using ull = unsigned long long;
using Matrix = std::vector<std::vector<ll>>;
const int inf = 1000000000;
const ll INF = 1000000000000000000;
const ll mod = 998244353;
const ull mod_hash = (1UL << 61) - 1;
const std::vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1};
const std::vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};

int main(){
  int N; cin >> N;
  int ans = 0;
  int now = 0;
  REP(i, N){
    int t, v; cin >> t >> v;
    ans -= (t - now);
    ans = max(0, ans);
    now = t;
    ans += v;
  }
  cout << ans << endl;
  return 0;
}

提出情報

ジャッジ結果