Submission #60511888

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <ctime>
#include <map>
#include <set>

#define rall(x) (x).rbegin(), (x).rend()
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define mpair make_pair
#define ld long double
#define ll long long
#define ss second
#define ff first

using namespace std;

const ll lINF = 1000000000000000007;
const int iINF = 1000000007;
const int INF = 1e5+1;

/* 
*/

void solve(){
	int n; cin >> n;
	vector <pii> a(n);
	int cur = 0;
	for(auto& i :a) cin >> i.ff >> i.ss;
	cur = a[0].ss;
	for(int i = 1; i < n; ++ i){
		int x = a[i].ff-a[i-1].ff;
		cur = max(0, cur - x);
		cur += a[i].ss;
		// cerr << a[i].ss << ' ';
	}
	cout << cur;
}

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int tt = 1; 
	// cin >> tt;
	while(tt --){
		solve();
		cout << '\n';
	}
	return 0;	
}

Submission Info

Judge Result