제출 #539728

#제출 시각아이디문제언어결과실행 시간메모리
539728krit3379Art Exhibition (JOI18_art)C++17
100 / 100
304 ms28728 KiB
#include<bits/stdc++.h>
using namespace std;
#define N 500005

long long qs[N],ma[N],ans;
pair<long long,long long> a[N];

int main(){
    int n,i;
    scanf("%d",&n);
    for(i=1;i<=n;i++)scanf("%lld %lld",&a[i].first,&a[i].second);
    sort(a+1,a+n+1);
    a[0].first=a[1].first;
    for(i=1;i<=n;i++)qs[i]=a[i].second+qs[i-1];
    for(i=n,ma[n+1]=-1e18;i>0;i--)ma[i]=max(qs[i]-a[i].first,ma[i+1]);
    for(i=1;i<=n;i++)ans=max(ans,ma[i]-qs[i-1]+a[i].first);
    printf("%lld",ans);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

art.cpp: In function 'int main()':
art.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
art.cpp:11:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     for(i=1;i<=n;i++)scanf("%lld %lld",&a[i].first,&a[i].second);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...