제출 #225456

#제출 시각아이디문제언어결과실행 시간메모리
225456NightlightArt Exhibition (JOI18_art)C++14
100 / 100
295 ms21112 KiB
#include <bits/stdc++.h> #define pii pair<long long, long long> #define a first #define b second using namespace std; int N; pii A[500005]; long long ans, best = -1e9; //pre[i] - pre[j - 1] - (A[i] - A[j]) //pre[i] - A[i] + (A[j] - pre[j - 1]) int main() { // freopen("inp", "r", stdin); scanf("%d", &N); for(int i = 1; i <= N; i++) { scanf("%lld %lld", &A[i].a, &A[i].b); } sort(A + 1, A + N + 1); for(int i = 1; i <= N; i++) { A[i].b += A[i - 1].b; best = max(best, A[i].a - A[i - 1].b); ans = max(ans, A[i].b - A[i].a + best); } printf("%lld\n", 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("%d", &N);
   ~~~~~^~~~~~~~~~
art.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld", &A[i].a, &A[i].b);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...