oj.uz

Submission #1049814

# Submission time Handle Problem Language Result Execution time Memory
1049814 2024-08-09T05:27:29 Z vjudge1 Art Exhibition (JOI18_art) C++17
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
int main() {
    int n;
    cin >> n;
    pair<long long, long long> a[n];long long pref[n+1]; pref[0]=0;
    for(int i=0; i<n; i++){
        cin >> a[i].f >> a[i].s;
    }
    sort(a, a+n);
    for(int i=0; i<n; i++){
        pref[i+1]=pref[i]+a[i].s;
    }
    long long mx=-INT64_MAX;
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            mx=max(mx, pref[j+1]-pref[i]-a[j].f+a[i].f);
        }
    }
    cout << mx;
    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 50.0

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