Cod sursa(job #3236860)
Utilizator | Data | 3 iulie 2024 11:16:34 | |
---|---|---|---|
Problema | Orase | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("orase.in");
ofstream fout("orase.out");
int main()
{
int m,n,maxd=0;
fin>>m>>n;
vector<int>d(n),l(n);
for(int i=0;i<n;i++){
fin>>d[i]>>l[i];
if(m+d[i]+l[i]>maxd) maxd=m+d[i]+l[i];
}
fout<<maxd;
return 0;
}