제출 #134240

#제출 시각아이디문제언어결과실행 시간메모리
134240BoxworldArt Exhibition (JOI18_art)C++14
100 / 100
277 ms20984 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxN=500010;
struct art{ll size,val;}a[maxN];
bool cmp(art x,art y){return x.size<y.size;}
int main(){
	int n;
	scanf("%d",&n);
	for (int i=0;i<n;i++)scanf("%lld%lld",&a[i].size,&a[i].val);
	sort(a,a+n,cmp);
	ll ans=0,best=a[0].size,val=0;
	for (int i=0;i<n;i++){
		val+=a[i].val;
		ans=max(ans,val+best-a[i].size);
		best=max(best,a[i+1].size-val);
	}
	printf("%lld\n",ans);
}

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

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