Cod sursa(job #1443346)
| Utilizator | Data | 27 mai 2015 19:20:23 | |
|---|---|---|---|
| Problema | Orase | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("orase.in");
ofstream fout("orase.out");
vector<pair<int, int>> v;
int best, n, m, d, l, maxx;
int main()
{
fin >> m >> n;
for (; n; n--){
fin >> d >> l;
v.push_back(make_pair(d, l));
}
sort(v.begin(), v.end());
for (auto it: v){
maxx = max(maxx, it.first + it.second + best);
best = max(best, it.second - it.first);
}
fout << maxx;
return 0;
}
