제출 #98769

#제출 시각아이디문제언어결과실행 시간메모리
98769Sasuke0004Art Exhibition (JOI18_art)C++17
100 / 100
723 ms13428 KiB
#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
long long n,m,ans,as[1000006];
pair<long long,long long>a[1000006];
int main ()
{
  cin>>n;
  for(int i=1;i<=n;i++)
  {
    cin>>a[i].f>>a[i].s;
  }
  sort(a+1,a+n+1);
  ans=as[1]=a[1].s;
  for(int i=2;i<=n;i++)
  {
    long long ans1=as[i-1]+a[i].s-(a[i].f-a[i-1].f);
    as[i]=max(ans1,(a[i].s));
    ans=max(ans,as[i]);
  }
  cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...