Submission #134236

#	Time	Username	Problem	Language	Result	Execution time	Memory
134236		Boxworld	Art Exhibition (JOI18_art)	C++14	50 / 100	1047 ms	24720 KiB

art

#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);
}

Compilation message (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);
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 50