This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |