제출 #939595

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
939595		vjudge1	Art Exhibition (JOI18_art)	C++17	100 / 100	138 ms	24764 KiB

art

#include <bits/stdc++.h>

#pragma optimize("Ofast")
#pragma target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll

const int MAX=5e5+15;
const int B=2e5;
const int N=104;
const int block=450;
const int maxB=MAX/B+10;
const ll inf=1e18;  
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;

int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};

int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1);
  int k=binpow(a,n/2);
  return k*k;
}

int n;
pii a[MAX];
int p[MAX];

void solve(){
  cin>>n;
  for(int i=1;i<=n;i++)cin>>a[i].F>>a[i].S;
  sort(a+1,a+n+1);
  for(int i=1;i<=n;i++){
    p[i]=p[i-1]+a[i].S;
  }
  int mx=-inf;
  int ans=0;
  for(int i=n;i>=1;i--){
    mx=max(mx,p[i]-a[i].F);
    ans=max(ans,mx-p[i-1]+a[i].F);
  }
  cout<<ans<<"\n";
}

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;
  while(t--)solve();
}

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

art.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
art.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

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