oj.uz

Submission #81935

# Submission time Handle Problem Language Result Execution time Memory
81935 2018-10-28T01:28:25 Z mra2322001 Art Exhibition (JOI18_art) C++11
0 / 100
 2 ms 376 KB 
#include <bits/stdc++.h>
#define f0(i, n) for(int i(0); i < (n); i++)
#define f1(i, n) for(int i(1); i <= n; i++)

using namespace std;
typedef long long ll;
const int N = 500002;

struct data{
    ll a, b;
} a[N];
bool cmp(data a1, data a2){
    return a1.a < a2.a;
}

int n; ll f[N];

int main(){
    ios_base::sync_with_stdio(0);
    ///freopen("A.inp", "r", stdin);

    cin >> n;
    f1(i, n) cin >> a[i].a >> a[i].b;

    sort(a + 1, a + n + 1, cmp);

    ll ma = LLONG_MIN;
    f1(i, n){
        f[i] = a[i].b;
        f[i] = max(f[i], ma + a[i].b - a[i].a);
        ma = max(ma, f[i] + a[i].a);
    }
    cout << *max_element(f + 1, f + n + 1);
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 50.0

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