제출 #134236

#제출 시각아이디문제언어결과실행 시간메모리
134236BoxworldArt Exhibition (JOI18_art)C++14
50 / 100
1047 ms24720 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;}
ll v[maxN],ans=0;
int main(){
	int n;
	scanf("%d",&n);
	for (int i=1;i<=n;i++)scanf("%lld%lld",&a[i].size,&a[i].val);
	sort(a+1,a+n+1,cmp);
	v[0]=0;
	for (int i=1;i<=n;i++)v[i]=v[i-1]+a[i].val;
	for (int i=1;i<=n;i++)
	for (int j=i;j<=n;j++)
	ans=max(ans,v[j]-v[i-1]+a[i].size-a[j].size);
	printf("%lld\n",ans);
}

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

art.cpp: In function 'int main()':
art.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
art.cpp:11:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i=1;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...