Submission #60515049

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
//以下マクロ
using ll = long long;
#define distance2(x1, y1, x2, y2) (((x2) - (x1)) * ((x2) - (x1)) + ((y2) - (y1)) * ((y2) - (y1))) //二乗無し
//入力
#define INPUT1(x) ll x; cin >> x;
#define INPUT2(x, y) ll x, y; cin >> x >> y;
#define INPUT3(x, y, z) ll x, y, z; cin >> x >> y >> z;
//REP
#define rep(i, n) for (ll i = 0; i < (n); ++i)

#define ALL(x) (x).begin(), (x).end()
#define rALL(x) (x).rbegin(), (x).rend()
//メモ
//next_permutation(v.begin(), v.end()) 順列全探索

int main(){
    ll ans = 0;
    INPUT1(n);
    vector<ll> t(n), v(n);
    for(ll i = 0; i < n; i++){
        cin >> t[i] >> v[i];
    }
    for(ll i = 0; i < n; i++){
        if(i != 0) ans -= t[i] - t[i-1];
        if(ans < 0) ans  =0;
        ans += v[i];
    }
    cout << ans << endl;
}

Submission Info

Judge Result