oj.uz

Submission #539420

# Submission time Handle Problem Language Result Execution time Memory
539420 2022-03-18T20:58:38 Z Antekb Art Exhibition (JOI18_art) C++14
0 / 100
 1 ms 212 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
using namespace std;
using ll=long long;

int main(){
    int n;
    cin>>n;
    vector<pair<ll, int> > V(n);
    for(auto &i:V){
        cin>>i.st>>i.nd;
    }
    sort(V.begin(), V.end());
    ll s=0, m=-V.back().st;
    ll ans=m;
    for(int i=0; i<n; i++){
        //cout<<s<<" "<<m<<" "<<V[i].st<<" "<<V[i].nd<<"\n";
        if(i)ans=max(ans, s+m-V[i-1].st);
        m=max(m, V[i].st-s);
        s+=V[i].nd;
    }
    cout<<ans<<"\n";
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -