Pagini recente » Cod sursa (job #3176752) | Cod sursa (job #158083) | Cod sursa (job #322039) | Cod sursa (job #1380231) | Cod sursa (job #3181185)
#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]);
}
}
}
int sum = 0;
int datadeiesire = b[1];
for (int i = 1; i <= n; i++) {
if (datadeiesire >= b[i]) {
datadeiesire = a[i];
sum += abs(a[i] - b[i]);
}
}
out << sum;
}