oj.uz

답안 #916763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916763 2024-01-26T13:38:56 Z a_l_i_r_e_z_a Art Exhibition (JOI18_art) C++17
0 / 100
 0 ms 348 KB 
// In the name of God
// Hope is last to die

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())

const int maxn = 5e5 + 5;
const int inf = 1e9 + 7;
int n; 
pll a[maxn];

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n; 
    for(int i = 0; i < n; i++) cin >> a[i].F >> a[i].S;
    sort(a, a + n);
    ll ans = 0, res = a[0].F;
    for(int i = 0; i < n; i++){
        smax(ans, res + a[i].S - a[i].F);
        res = max(res + a[i].S, a[i].F + a[i].S);
    }
    cout << ans << '\n';

    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -