답안 #367862

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
367862	2021-02-18T14:40:25 Z	vaaven	Art Exhibition (JOI18_art)	C++14	100 / 100	203 ms	20076 KB

#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <stack>
#include <iomanip>
#include <bitset>
#include <map>
#include <cassert>
#include <array>
#include <queue>
#include <cstring>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define pqueue priority_queue
#define pb(x) push_back(x)
// #define endl '\n'
#define all(x) x.begin(), x.end()
 #define int long  long
    
using namespace std;
    
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
// typedef tuple<ll, ll, ll> tiii;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
    
const int inf = 1e9 + 228;
const int infll = 1e18;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-14;
    
    
void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
   // freopen("a.in", "r", stdin);
//    freopen("outputik.txt", "w", stdout);
}

void solve(){
    int n;
    cin >> n;
    vpii kek(n);
    for(int i=0; i<n; i++){
        cin >> kek[i].first >> kek[i].second;
    }
    sort(all(kek));
    for(int i=1; i<n; i++){
        kek[i].second += kek[i-1].second;
    }
    int mn = 0;
    int ans = -infll;
    for(int i=0; i<n; i++){
        if(i)
            mn = min(mn, kek[i-1].second - kek[i].first);
        else
            mn = -kek[i].first;
        ans = max(kek[i].second - kek[i].first - mn, ans);
    }
    cout << ans << endl;
}

signed main(){
     fast_io();
//  ;(time(NULL));
    cout << fixed << setprecision(10);
    int q = 1;
//    cin >> q;
    while(q--)
        solve();
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	2 ms	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	2 ms	492 KB	Output is correct
30	Correct	2 ms	492 KB	Output is correct
31	Correct	2 ms	492 KB	Output is correct
32	Correct	3 ms	492 KB	Output is correct
33	Correct	2 ms	492 KB	Output is correct
34	Correct	2 ms	492 KB	Output is correct
35	Correct	3 ms	492 KB	Output is correct
36	Correct	2 ms	492 KB	Output is correct
37	Correct	2 ms	492 KB	Output is correct
38	Correct	3 ms	492 KB	Output is correct
39	Correct	3 ms	492 KB	Output is correct
40	Correct	2 ms	492 KB	Output is correct
41	Correct	2 ms	508 KB	Output is correct
42	Correct	2 ms	492 KB	Output is correct
43	Correct	2 ms	492 KB	Output is correct
44	Correct	3 ms	492 KB	Output is correct
45	Correct	2 ms	492 KB	Output is correct
46	Correct	2 ms	492 KB	Output is correct
47	Correct	2 ms	492 KB	Output is correct
48	Correct	2 ms	492 KB	Output is correct
49	Correct	2 ms	492 KB	Output is correct
50	Correct	2 ms	492 KB	Output is correct
51	Correct	2 ms	492 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	2 ms	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	2 ms	492 KB	Output is correct
30	Correct	2 ms	492 KB	Output is correct
31	Correct	2 ms	492 KB	Output is correct
32	Correct	3 ms	492 KB	Output is correct
33	Correct	2 ms	492 KB	Output is correct
34	Correct	2 ms	492 KB	Output is correct
35	Correct	3 ms	492 KB	Output is correct
36	Correct	2 ms	492 KB	Output is correct
37	Correct	2 ms	492 KB	Output is correct
38	Correct	3 ms	492 KB	Output is correct
39	Correct	3 ms	492 KB	Output is correct
40	Correct	2 ms	492 KB	Output is correct
41	Correct	2 ms	508 KB	Output is correct
42	Correct	2 ms	492 KB	Output is correct
43	Correct	2 ms	492 KB	Output is correct
44	Correct	3 ms	492 KB	Output is correct
45	Correct	2 ms	492 KB	Output is correct
46	Correct	2 ms	492 KB	Output is correct
47	Correct	2 ms	492 KB	Output is correct
48	Correct	2 ms	492 KB	Output is correct
49	Correct	2 ms	492 KB	Output is correct
50	Correct	2 ms	492 KB	Output is correct
51	Correct	2 ms	492 KB	Output is correct
52	Correct	201 ms	19964 KB	Output is correct
53	Correct	197 ms	19948 KB	Output is correct
54	Correct	196 ms	19948 KB	Output is correct
55	Correct	200 ms	20076 KB	Output is correct
56	Correct	198 ms	19948 KB	Output is correct
57	Correct	200 ms	20076 KB	Output is correct
58	Correct	199 ms	19948 KB	Output is correct
59	Correct	199 ms	19948 KB	Output is correct
60	Correct	196 ms	19948 KB	Output is correct
61	Correct	202 ms	19948 KB	Output is correct
62	Correct	197 ms	19948 KB	Output is correct
63	Correct	202 ms	20076 KB	Output is correct
64	Correct	203 ms	19948 KB	Output is correct
65	Correct	196 ms	19948 KB	Output is correct
66	Correct	201 ms	19948 KB	Output is correct
67	Correct	202 ms	19948 KB	Output is correct
68	Correct	198 ms	19948 KB	Output is correct

답안 #367862

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0