Cod sursa(job #3324098)
| Utilizator | Data | 21 noiembrie 2025 08:27:48 | |
|---|---|---|---|
| Problema | Orase | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("orase.in");
ofstream fout("orase.out");
int m,n;
struct strada{
int d,l;
}A[50001];
bool ord(strada a, strada b)
{
if(a.d<b.d)
return true;
if(a.d==b.d && a.l>b.l)
return true;
return false;
}
int main()
{
fin>>m>>n;
for(int i=1;i<=n;i++)
fin>>A[i].d>>A[i].l;
int distMax=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
distMax=max(distMax,A[i].l+A[j].l+abs(A[j].d-A[i].d));
fout<<distMax;
return 0;
}
