oj.uz

답안 #206154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
206154 2020-03-02T13:28:56 Z SoGood Art Exhibition (JOI18_art) C++17
0 / 100
 5 ms 256 KB 
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define fo(i, n1, n, x) for(int i = n1; i <= n; i += x)
#define foo(i, n, n1, x) for(int i = n; i >= n1; i -= x)

using namespace std;


#define int ll
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;



const int N = 5e5 + 11;
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

int n;
pii a[N];
main() {
  cin>>n;
  fo(i,1,n,1) cin>>a[i].F>>a[i].S;
  sort(a+1,a+n+1, greater<pii>());
  int r = 0,sum=0,ans=0;
  fo(l,1,n,1) {
    if (r<l) r=l,sum=a[l].S;
    while (r + 1 <= n) {
      int val1=sum-a[l].F+a[r].F;
      int val2=sum+a[r+1].S-a[l].F+a[r+1].F;
      if (val2 > val1) ++r,sum+=a[r].S;
      else break;
    }
//    cout<<l<<' '<<r<<' '<<a[l].F<<' '<<a[r].F<<' '<<sum<<'\n';
    chmax(ans,sum-a[l].F+a[r].F);
    sum-=a[l].F;
  //  if (sum-a[l].F+a[r].F==8) cout<<"CH "<<l<<' '<<r<<'\n';
  }
  cout<<ans;
  return 0;
}
/**
15
1543361732 260774320
2089759661 257198921
1555665663 389548466
4133306295 296394520
2596448427 301103944
1701413087 274491541
2347488426 912791996
2133012079 444074242
2659886224 656957044
1345396764 259870638
2671164286 233246973
2791812672 585862344
2996614635 91065315
971304780 488995617
1523452673 988137562
*/

Compilation message

art.cpp:24:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -