Pagini recente » Cod sursa (job #1968886) | Cod sursa (job #1541297) | Cod sursa (job #1922756) | Cod sursa (job #1507726) | Cod sursa (job #3181396)
#include <iostream>
#include <cmath>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("heavymetal.in");
ofstream out("heavymetal.out");
int main() {
int n;
int a[10001];
int b[10001];
in >> n;
for (int i = 1; i <= n; i++) {
in >> a[i] >> b[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if ((abs(a[i] - b[i]) > abs(a[j] - b[j])) || (abs(a[i]-b[i]) == abs(a[j]-b[j]) && a[i] > a[j]) || (abs(a[i] - b[i]) == abs(a[j] - b[j]) && a[i] == a[j] && b[i]>b[j])){
swap(a[i], a[j]);
swap(b[i], b[j]);
}
}
}
long long sum = 0;
int datadeiesire = b[1];
for (int i = 1; i <= n; i++){
if (datadeiesire >= b[i]) {
sum += abs(a[i] - b[i]);
datadeiesire = a[i];
}
}
out << sum;
}