Submission #63335

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
63335	2018-08-01 13:10:18	leejseo	Art Exhibition (JOI18_art)	C++14	50 / 100	1066 ms	28584 KiB

art

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<iostream>
#include<memory.h>
#include<utility>
#include<algorithm>
#include<vector>
 
using namespace std;
 
typedef long long lld;
 
lld n, s[500001] = {0LL, }, a, b, tmp;
vector<pair<lld, lld>> art;
 
int main() {
    ios::sync_with_stdio(0); 
    cin.tie(0);
    cin >> n;
    art.push_back(pair<lld, lld>(0, 0));
    for(int i = 0; i < n; i++) {
        cin >> a >> b;
        art.push_back(pair<lld, lld>(a, b));
    }
    sort(art.begin(), art.end());
    for(int i = 1; i <= n; i++) {
        s[i] = s[i-1] + art[i].second;
    }
    lld tmp = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = i; j <= n; j++) {
            tmp = max(tmp, s[j] - s[i-1] - (art[j].first - art[i].first));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 50