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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long llg;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int nbPlats;
cin >> nbPlats;
vector<pair<llg, llg>> plats(nbPlats);
for (int indPlat = 0; indPlat < nbPlats; ++indPlat) {
// Taille puis valeur
cin >> plats[indPlat].first >> plats[indPlat].second;
}
// Tri par taille
sort(plats.begin(), plats.end());
llg curSom = 0;
llg ans = 0;
llg meilleurBas = 0;
for (int indPlat = 0; indPlat < nbPlats; ++indPlat) {
llg scoreBas = -(curSom - plats[indPlat].first);
curSom += plats[indPlat].second;
llg scoreHaut = curSom - plats[indPlat].first;
if (indPlat == 0) meilleurBas = scoreBas;
meilleurBas = max(meilleurBas, scoreBas);
ans = max(scoreHaut+meilleurBas, ans);
}
cout << ans << "\n";
}
# | 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... |