oj.uz

Submission #1006850

# Submission time Handle Problem Language Result Execution time Memory
1006850 2024-06-24T09:18:29 Z faqinyeager Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
using ll = long long;
 
int n;
vector<pair<ll, ll>> a;
 
int main(){
    cin >> n;
    
    for(int i = 0; i < n; i++){
        int x, y;
        cin >> x >> y;
        a.push_back({x, y});
    }
    
    sort(a.begin(), a.end());
    
    ll best = 0, cur = 0;
    
    for(int i = 0; i < n; i++){
        cur += a[i].ss;
        cur = max(cur, a[i].ss + a[i].ff);
        best = max(best, cur - a[i].ff);
    }
    
    cout << best;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -