oj.uz

Submission #1106081

# Submission time Handle Problem Language Result Execution time Memory
1106081 2024-10-29T07:54:06 Z ngokhanh Art Exhibition (JOI18_art) C++17
50 / 100
 1000 ms 12872 KB 
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i=a;i<=b;i++)
#define rep2(i,a,b,c) for (int i=a;i<=b;i+=c)
#define rev(i,a,b) for (int i=a;i>=b;i--)
#define rev2(i,a,b,c) for (int i=a;i>=b;i-=c)
#define ii pair<ll,ll>
#define bit(i,j) ((i>>j)&1)
#define ull unsigned long long
#define pb push_back
#define pf push_front
#define ll long long
#define F first
#define S second
#define sz(a) (int)(a.size())
#define on(n) __builtin_popcountll(n)
#define ld long double
#define __log2(x) 63-__builtin_clzll(x)
#define Mask(x) (1LL<<x)
#define ALL(v) v.begin(),v.end()

const int N=3e5+5;
const int mod=998244353;

int n;
ii A[N];
ll p[N];

void solution(){
    cin >> n;
    rep(i,1,n) cin >> A[i].F >> A[i].S;
    sort(A+1,A+1+n);
    rep(i,1,n) p[i]=p[i-1]+A[i].S;
    ll res=LLONG_MIN,Min=LLONG_MAX;
    rep(i,1,n){
        Min=min(Min,p[i-1]-A[i].F);
        res=max(res,p[i]-A[i].F-Min);
    }
    cout << res;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int test=1;
    //cin >> test;
    while(test--)
        solution();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2552 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2552 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2524 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2536 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 2384 KB Output is correct
24 Correct 1 ms 2384 KB Output is correct
25 Correct 1 ms 2384 KB Output is correct
26 Correct 1 ms 2384 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2552 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2524 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2536 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 2384 KB Output is correct
24 Correct 1 ms 2384 KB Output is correct
25 Correct 1 ms 2384 KB Output is correct
26 Correct 1 ms 2384 KB Output is correct
27 Correct 2 ms 2812 KB Output is correct
28 Correct 2 ms 2524 KB Output is correct
29 Correct 2 ms 2896 KB Output is correct
30 Correct 2 ms 2636 KB Output is correct
31 Correct 2 ms 2640 KB Output is correct
32 Correct 2 ms 2640 KB Output is correct
33 Correct 2 ms 2640 KB Output is correct
34 Correct 3 ms 2640 KB Output is correct
35 Correct 2 ms 2628 KB Output is correct
36 Correct 2 ms 2640 KB Output is correct
37 Correct 3 ms 2808 KB Output is correct
38 Correct 2 ms 2640 KB Output is correct
39 Correct 2 ms 2640 KB Output is correct
40 Correct 2 ms 2812 KB Output is correct
41 Correct 2 ms 2640 KB Output is correct
42 Correct 2 ms 2808 KB Output is correct
43 Correct 2 ms 2640 KB Output is correct
44 Correct 2 ms 2640 KB Output is correct
45 Correct 2 ms 2640 KB Output is correct
46 Correct 2 ms 2640 KB Output is correct
47 Correct 2 ms 2808 KB Output is correct
48 Correct 2 ms 2628 KB Output is correct
49 Correct 2 ms 2640 KB Output is correct
50 Correct 2 ms 2444 KB Output is correct
51 Correct 2 ms 2640 KB Output is correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2552 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2524 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2536 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 2384 KB Output is correct
24 Correct 1 ms 2384 KB Output is correct
25 Correct 1 ms 2384 KB Output is correct
26 Correct 1 ms 2384 KB Output is correct
27 Correct 2 ms 2812 KB Output is correct
28 Correct 2 ms 2524 KB Output is correct
29 Correct 2 ms 2896 KB Output is correct
30 Correct 2 ms 2636 KB Output is correct
31 Correct 2 ms 2640 KB Output is correct
32 Correct 2 ms 2640 KB Output is correct
33 Correct 2 ms 2640 KB Output is correct
34 Correct 3 ms 2640 KB Output is correct
35 Correct 2 ms 2628 KB Output is correct
36 Correct 2 ms 2640 KB Output is correct
37 Correct 3 ms 2808 KB Output is correct
38 Correct 2 ms 2640 KB Output is correct
39 Correct 2 ms 2640 KB Output is correct
40 Correct 2 ms 2812 KB Output is correct
41 Correct 2 ms 2640 KB Output is correct
42 Correct 2 ms 2808 KB Output is correct
43 Correct 2 ms 2640 KB Output is correct
44 Correct 2 ms 2640 KB Output is correct
45 Correct 2 ms 2640 KB Output is correct
46 Correct 2 ms 2640 KB Output is correct
47 Correct 2 ms 2808 KB Output is correct
48 Correct 2 ms 2628 KB Output is correct
49 Correct 2 ms 2640 KB Output is correct
50 Correct 2 ms 2444 KB Output is correct
51 Correct 2 ms 2640 KB Output is correct
52 Execution timed out 1045 ms 12872 KB Time limit exceeded
53 Halted 0 ms 0 KB -