제출 #64134

#제출 시각아이디문제언어결과실행 시간메모리
64134keko37Art Exhibition (JOI18_art)C++14
0 / 100
2 ms248 KiB
#include<iostream> #include<cstdio> #include<algorithm> using namespace std; typedef long long llint; const int MAXN = 500005; llint n, sol, mx; llint s[MAXN]; pair <llint, llint> p[MAXN]; int main () { cin >> n; for (int i=1; i<=n; i++) { scanf("%lld%lld", &p[i].first, &p[i].second); } sort(p+1, p+n+1); for (int i=1; i<=n; i++) { s[i] = p[i].second + s[i-1]; } for (int i=n; i>=1; i--) { mx = max(mx, s[i] - p[i].first); sol = max(sol, mx + p[i].first - s[i-1]); } cout << sol; return 0; }

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

art.cpp: In function 'int main()':
art.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &p[i].first, &p[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...