Cod sursa(job #1671161)
| Utilizator | Data | 1 aprilie 2016 13:38:03 | |
|---|---|---|---|
| Problema | Orase | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.71 kb |
#include<bits/stdc++.h>
using namespace std;
int n,m,i,D,L,max1[100001],max2[100001];
int main(){
cin>>m>>n;
for(;i<=m;++i)
max1[i]=max2[i]=-0x3f3f3f3f;
for(i=0;i<n;++i)
{
cin>>D>>L;
if(L>max1[D])
max2[D]=max1[D],
max1[D]=L;
else
if(L>max2[D])
max2[D]=L;
}
int maxx=-0x3f3f3f3f,max_c=-0x3f3f3f3f;
for(i=0;i<=m;++i)
{
if(maxx < max1[i]+max2[i])
maxx = max1[i]+max2[i];
max_c++;
if(maxx < max_c+max1[i])
maxx = max_c+max1[i];
if(max_c <
max1[i])
max_c = max1[i];
}
cout<<maxx;
return 0;
}
