Cod sursa(job #3237018)
| Utilizator | Data | 4 iulie 2024 08:29:24 | |
|---|---|---|---|
| Problema | Orase | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
ifstream fin("orase.in");
ofstream fout("orase.out");
int main() {
int m,n,maxi=0;
fin>>m>>n;
vector<int>l(n),d(n);
for(int i=0;i<n;i++){
fin>>d[i]>>l[i];
maxi=max(maxi,m+d[i]+l[i]);
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
maxi=max(maxi,d[i]+l[i]+d[j]+l[j]-m);
}
}
fout<<maxi;
return 0;
}
