제출 #127321

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
127321		josefu_	Art Exhibition (JOI18_art)	C++14	50 / 100	1075 ms	7496 KiB

art

#define SuC_VaT              Doc_code_ban_khac
#define Nhan_cach_bang_0     Doc_code_ban_khac

#include <bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> ii;
typedef pair<ll, ii > iii;

const int kn = 4e5 + 5, N = 1e5+5;
const ll mod = 1e9 + 7, mod2 = 1e9+9;
const ll base = 31, base1 = 37;

#define x first
#define y second
#define lwb lower_bound
#define upb upper_bound

#define pb push_back
#define popb pop_back
#define pf push_front
#define popf pop_front

#define log2(X) (31-__builtin_clz(X))
#define log2ll(X) (63-__builtin_clzll(X))
#define numbit(X) __builtin_popcount(X)
#define numbitll(X) __builtin_popcountll(X)

#define ms(val,a) memset(a,val,sizeof(a))

#define ff(i,n) for(int i=1;i<=n;i++)
#define _ff(i,n) for(int i=n;i>=1;i--)
#define f(i,a,b) for(int i = a; i <=b; i++)
#define _f(i,a,b) for(int i = b; i>=a;i--)

#define In(X) freopen(X,"r",stdin)
#define Out(X) freopen(X,"w",stdout)

#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int n;
ii cac[kn];
ll pre[kn], ans = 0;

set< ii > S;

int main()
{
	scanf("%d",&n);
	ff(i,n)
	{
		scanf("%lld %lld",&cac[i].x,&cac[i].y);
	}
	sort(cac+1,cac+n+1);
	ff(i,n)
	{
		pre[i]  = pre[i-1] + cac[i].y;
		S.insert({pre[i]-cac[i].x, i});
	}
	ff(i,n)
	{
		while(S.rbegin()->second < i) S.erase(prev(S.end()));
		ans = max(ans,(S.rbegin()->first) + cac[i].x - pre[i-1] );
	}
	printf("%lld",ans);
	
}

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

art.cpp: In function 'int main()':
art.cpp:53:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
art.cpp:56:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&cac[i].x,&cac[i].y);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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