oj.uz

Submission #787267

# Submission time Handle Problem Language Result Execution time Memory
787267 2023-07-19T01:30:53 Z guagua0407 Dango Maker (JOI18_dango_maker) C++17
0 / 100
 1 ms 324 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

int main() {_
    int n;
    cin>>n;
    pair<ll,ll> num[n+1];
    for(int i=1;i<=n;i++){
        cin>>num[i].f>>num[i].s;
    }
    sort(num+1,num+(n+1));
    vector<ll> pre(n+1,0);
    for(int i=1;i<=n;i++){
        pre[i]=pre[i-1]+num[i].s;
    }
    priority_queue<pair<ll,ll>> pq;
    for(int i=1;i<=n;i++){
        pq.push({pre[i]-num[i].f,i});
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
        while(pq.top().s<i){
            pq.pop();
        }
        auto v=pq.top();
        ans=max(ans,-pre[i-1]+num[i].f+v.f);
    }
    cout<<ans<<'\n';
    return 0;
}
//maybe its multiset not set

Compilation message

dango_maker.cpp: In function 'void setIO(std::string)':
dango_maker.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -