답안 #246130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246130	2020-07-08T08:51:39 Z	Evirir	Art Exhibition (JOI18_art)	C++17	100 / 100	298 ms	24824 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

bool DEBUG = 0;
const int MAXN = 500005;

int n;
ii a[MAXN];
ll pre[MAXN];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n;
	forn(i,0,n) cin>>a[i].F>>a[i].S;
	
	sort(a,a+n);
	forn(i,0,n){
		pre[i]=a[i].S;
		if(i>0) pre[i]+=pre[i-1];
	}
	
	ll Max=0,ans=0;
	forn(i,0,n)
	{
		Max=max(Max, a[i].F-(i==0?0LL:pre[i-1]));
		ans=max(ans, pre[i]-a[i].F+Max);
	}
	
	cout<<ans<<'\n';
	
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	6 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	432 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	7 ms	640 KB	Output is correct
28	Correct	7 ms	640 KB	Output is correct
29	Correct	7 ms	640 KB	Output is correct
30	Correct	7 ms	640 KB	Output is correct
31	Correct	7 ms	640 KB	Output is correct
32	Correct	7 ms	640 KB	Output is correct
33	Correct	7 ms	640 KB	Output is correct
34	Correct	7 ms	640 KB	Output is correct
35	Correct	7 ms	640 KB	Output is correct
36	Correct	7 ms	640 KB	Output is correct
37	Correct	7 ms	640 KB	Output is correct
38	Correct	7 ms	640 KB	Output is correct
39	Correct	7 ms	640 KB	Output is correct
40	Correct	7 ms	640 KB	Output is correct
41	Correct	7 ms	640 KB	Output is correct
42	Correct	7 ms	640 KB	Output is correct
43	Correct	7 ms	640 KB	Output is correct
44	Correct	7 ms	640 KB	Output is correct
45	Correct	7 ms	640 KB	Output is correct
46	Correct	7 ms	640 KB	Output is correct
47	Correct	7 ms	640 KB	Output is correct
48	Correct	7 ms	640 KB	Output is correct
49	Correct	7 ms	640 KB	Output is correct
50	Correct	7 ms	640 KB	Output is correct
51	Correct	7 ms	640 KB	Output is correct
52	Correct	234 ms	24748 KB	Output is correct
53	Correct	228 ms	24696 KB	Output is correct
54	Correct	227 ms	24696 KB	Output is correct
55	Correct	237 ms	24824 KB	Output is correct
56	Correct	242 ms	24732 KB	Output is correct
57	Correct	233 ms	24696 KB	Output is correct
58	Correct	264 ms	24824 KB	Output is correct
59	Correct	242 ms	24696 KB	Output is correct
60	Correct	232 ms	24696 KB	Output is correct
61	Correct	232 ms	24572 KB	Output is correct
62	Correct	231 ms	24824 KB	Output is correct
63	Correct	229 ms	24740 KB	Output is correct
64	Correct	238 ms	24824 KB	Output is correct
65	Correct	231 ms	24696 KB	Output is correct
66	Correct	298 ms	24824 KB	Output is correct
67	Correct	227 ms	24696 KB	Output is correct
68	Correct	232 ms	24696 KB	Output is correct

답안 #246130

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