oj.uz

답안 #996137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996137 2024-06-10T08:13:56 Z imarn Art Exhibition (JOI18_art) C++14
0 / 100
 0 ms 344 KB 
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;
    ll ans=0;pll x[n+1];x[0]={0,0};
    for(int i=1;i<=n;i++)cin>>x[i].f>>x[i].s;
    sort(x+1,x+n+1);for(int i=1;i<=n;i++)x[i].s+=x[i-1].s;
    int l=1;
    for(int r=2;r<=n;r++){
        ans=max(ans,-x[r].f+x[l].f+x[r].s-x[l-1].s);
        if(x[r].f-x[r-1].s>x[l].f-x[l-1].s)l=r;
    }cout<<ans;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -