Pagini recente » Cod sursa (job #239277) | Cod sursa (job #756012) | Cod sursa (job #839722) | Cod sursa (job #1904418) | Cod sursa (job #2674432)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("heavymetal.in");
ofstream out("heavymetal.out");
struct spectacol {
long long int inceput;
long long int final;
long long int durata;
} v[100001], g[100000];
bool comp(spectacol a, spectacol b) {
return (a.durata > b.durata);
}
int n;
int main() {
ios::sync_with_stdio(false);
in.tie(NULL), out.tie(NULL);
in >> n;
for (int i = 1; i <= n; i++) {
in >> v[i].inceput >> v[i].final;
v[i].durata = v[i].final - v[i].inceput;
}
sort(v + 1, v + n + 1, comp);
int k = 1, nr = v[1].durata;
g[1] = v[1];
for (int i = 2; i <= n; i++) if (g[k].inceput >= v[i].final)g[++k] = v[i], nr += v[i].durata;
out << nr;
return 0;
}