제출 #946259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
946259		attky	Art Exhibition (JOI18_art)	C++17	100 / 100	140 ms	28740 KiB

art

#include <bits/stdc++.h>

using namespace std;

struct Art {
    long long int taille = 0;
    long long int valeur = 0;
    
    bool operator< (Art other) {
        return taille < other.taille;
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin >> n;
    vector<Art> stock(n+1);
    for(int loop = 1; loop <= n; ++loop) {
        cin >> stock[loop].taille >> stock[loop].valeur;
    }
    sort(stock.begin(), stock.end());
    for(int loop = 1; loop <= n; ++loop) {
        stock[loop].valeur += stock[loop-1].valeur;
    }
    long long int debut[n], fin[n];
    for(int loop = 0; loop < n; ++loop) {
        debut[loop] = stock[loop].valeur - stock[loop+1].taille;
        fin[loop] = stock[loop+1].valeur - stock[loop+1].taille;
    }
    long long int maxi = -1000000000000000000, mini = 1000000000000000000, somme = 0;
    for(int loop = 0; loop < n; ++loop) {
        if(fin[loop] > maxi) {
            maxi = fin[loop];
        }
        if(debut[loop] < mini) {
            mini = debut[loop];
            maxi = fin[loop];
        }
        somme = max(somme, maxi-mini);
    }
    cout << somme;
}

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