Contest Duration: - (local time) (180 minutes) Back to Home

Submission #9040160

Source Code Expand

Copy
```#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
（ ´_ゝ`）　/　 ⌒i     @hamayanhamayan0
／　　　＼　 　  |　|
/　　 /￣￣￣￣/　　|
＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/

int N;
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
vector<pair<int, int>> v;
rep(i, 0, N) {
int a, t;
cin >> a >> t;
v.push_back({ a, t });
}
sort(all(v));

ll t = max(v[N - 1].first, v[N - 1].second);
int x = v[N - 1].first;
rrep(i, N - 2, 0) {
t += x - v[i].first;
x = v[i].first;
chmax(t, 1LL * v[i].second);
}
t += x;
cout << t << endl;
}

```

#### Submission Info

Submission Time 2019-12-21 19:24:14+0900 B - いちご (Strawberry) hamayanhamayan C++14 (GCC 5.4.1) 100 1758 Byte AC 30 ms 1400 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
 AC × 3
 AC × 46
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
01-09.txt AC 5 ms 512 KB
01-10.txt AC 29 ms 1400 KB
01-11.txt AC 20 ms 1400 KB
01-12.txt AC 23 ms 1400 KB
01-13.txt AC 21 ms 1400 KB
01-14.txt AC 24 ms 1400 KB
01-15.txt AC 29 ms 1400 KB
01-16.txt AC 13 ms 892 KB
01-17.txt AC 15 ms 892 KB
01-18.txt AC 5 ms 512 KB
01-19.txt AC 25 ms 1400 KB
01-20.txt AC 29 ms 1400 KB
01-21.txt AC 6 ms 640 KB
01-22.txt AC 5 ms 640 KB
01-23.txt AC 24 ms 1400 KB
01-24.txt AC 30 ms 1400 KB
01-25.txt AC 29 ms 1400 KB
01-26.txt AC 26 ms 1400 KB
01-27.txt AC 24 ms 1400 KB
01-28.txt AC 29 ms 1400 KB
01-29.txt AC 29 ms 1400 KB
01-30.txt AC 29 ms 1400 KB
01-31.txt AC 27 ms 1400 KB
01-32.txt AC 25 ms 1400 KB
01-33.txt AC 29 ms 1400 KB
01-34.txt AC 29 ms 1400 KB
01-35.txt AC 29 ms 1400 KB
01-36.txt AC 27 ms 1400 KB
01-37.txt AC 25 ms 1400 KB
01-38.txt AC 29 ms 1400 KB
01-39.txt AC 29 ms 1400 KB
01-40.txt AC 28 ms 1400 KB
01-41.txt AC 26 ms 1400 KB
01-42.txt AC 25 ms 1400 KB
01-43.txt AC 29 ms 1400 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB