oj.uz

답안 #1105215

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1105215 2024-10-25T18:09:25 Z sktodow Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 336 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
     
#define int long long 
#define pb push_back
#define mid (l+(r-l)/2)
#define f first
#define s second
const int N=2505;
const int MOD=1e9+7;
const long long inf=2e18+5;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;


int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    
    int n; cin>>n;
    vector<array<int,2>>v(n);
    for(int i=0;i<n;i++){
        cin>>v[i][0]>>v[i][1];
    }
    sort(v.begin(),v.end());
    int ans=0;
    int curr=0;
    for(int i=0;i<n;i++){
        curr+=v[i][1];
        ans=max(ans,curr-v[i][0]+v[0][0]);
    }
    for(int i=0;i<n-1;i++){
        curr-=v[i][1];
        ans=max(ans,curr-v[n-1][0]+v[i+1][0]);
    }
    cout<<ans;
    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 50.0

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