제출 #127261

#제출 시각아이디문제언어결과실행 시간메모리
127261shuvi_dolaArt Exhibition (JOI18_art)C++14
0 / 100
2 ms376 KiB
#include <bits/stdc++.h> #define int long long #define fi first #define se second using namespace std; const int N = 1e5+3; int c[N], best[N], n, k; pair <int,int> pic[N]; signed main() { cin>>n; for(int i=1;i<=n;i++) { scanf("%lld %lld",&pic[i].fi,&pic[i].se); } sort(pic+1,pic+1+n); c[1] = pic[1].se; for(int i=2;i<=n;i++) { c[i] = pic[i].se - (pic[i].fi - pic[i-1].fi); } // for(int i=1;i<=n;i++) // { // cout<<c[i]<<' '; // } int ans = 0; for(int i=1;i<=n;i++) { best[i] = max(best[i-1] + c[i], c[i]); ans = max(ans, best[i]); } cout<<ans; }

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

art.cpp: In function 'int main()':
art.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&pic[i].fi,&pic[i].se);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...