Submission #1229408

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229408		duyhoanho	Art Exhibition (JOI18_art)	C++17	100 / 100	103 ms	12112 KiB

art

//ngocuti
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define fi first
#define se second

using namespace std;
const int N = 5e5 + 10, oo = 1e16;
int n, s[N];
pii a[N];
int32_t main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  if(fopen("task.inp","r")){
      freopen("task.inp","r",stdin);
      freopen("task.out","w",stdout);
  }
  #define task ""
  if(fopen(task".inp","r")){
      freopen(task".inp","r",stdin);
      freopen(task".out","w",stdout);
  }

  cin >> n;
  for(int  i = 1; i <= n; i++) cin >> a[i].fi >> a[i].se;
  sort(a + 1, a + n + 1);
  int  mx = 0;
  int ans = -oo;
  for(int i = 1; i <= n; i++){
    s[i] = s[i - 1] + a[i].se;
      mx = max(mx, a[i].fi - s[i - 1]);
    ans = max(ans, s[i] - a[i].fi + mx);
  }
  cout<<ans;
}

Compilation message (stderr)

art.cpp: In function 'int32_t main()':
art.cpp:17:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |       freopen("task.inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
art.cpp:18:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |       freopen("task.out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
art.cpp:22:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |       freopen(task".inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
art.cpp:23:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |       freopen(task".out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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