oj.uz

답안 #1049811

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049811 2024-08-09T05:25:42 Z vjudge1 Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pll pair<ll, ll>
#define fi first
#define se second
#define speed ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main() {
    speed;
    int n;
    cin >> n;
    vector<pll> a(n);
    int start = 0; bool ok = 1;
    for(int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se;
    sort(begin(a), end(a));
    for(int i = 0; i < n; i++) {
        if(a[i].se > a[i].fi && ok) {
            ok = 0;
            start = i;
        }
    }
    ll pref[n+1]{};
    pref[0] = a[0].se;
    ll ans = LLONG_MIN;
    for(int i = 1; i < n; i++) pref[i] = a[i].se + pref[i-1];
    for(int i = start + 1; i < n; i++) if(a[i].se > a[i].fi) ans = max(ans, pref[i] - (start ? pref[start-1] : 0ll) - (a[i].fi - a[start].fi));
    for(int i = 0; i < n; i++) ans = max(ans, a[i].se);
    cout << ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 50.0

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