제출 #466971

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
466971		jamezzz	Art Exhibition (JOI18_art)	C++17	100 / 100	208 ms	28612 KiB

art

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define ppb pop_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;
mt19937 rng(time(0));

int n;
ll a,b,pfx[500005],val[500005];
vll v;

int main(){
	sf("%d",&n);
	v.resize(n+1);
	for(int i=1;i<=n;++i){
		sf("%lld%lld",&v[i].fi,&v[i].se);
	}
	sort(all(v));
	ll mn=LINF,ans=-LINF;
	for(int i=1;i<=n;++i){
		pfx[i]=pfx[i-1]+v[i].se;
		val[i-1]=pfx[i-1]-v[i].fi;
		mnto(mn,val[i-1]);
		mxto(ans,pfx[i]-v[i].fi-mn);
	}
	pf("%lld\n",ans);
}

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

art.cpp: In function 'int main()':
art.cpp:37:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  sf("%d",&n);
      |    ^
art.cpp:40:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |   sf("%lld%lld",&v[i].fi,&v[i].se);
      |     ^

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