oj.uz

Submission #986354

# Submission time Handle Problem Language Result Execution time Memory
986354 2024-05-20T11:12:02 Z LOLOLO Hotel (CEOI11_hot) C++17
30 / 100
 550 ms 44700 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 2e5 + 10;
 
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m, o;
    cin >> n >> m >> o;

    set <pair <int, int>> st;
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        st.insert({b, a});
    }

    vector <pair <int, int>> save;
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        save.pb({a, b});
    }

    vector <ll> dis;
    sort(all(save), greater <pair <int, int>> ());
    for (auto x : save) {
        auto it = st.lower_bound({x.s, -1e9});
        if (it == st.end())
            continue;

        ll diff = x.f - it->second;
        dis.pb(diff);
        st.erase(it);
    }

    ll ans = 0;

    sort(all(dis), greater <ll> ());
    for (int i = 0; i < min(sz(dis), o); i++) {
        ans += max(dis[i], (ll)0);
    }

    cout << ans << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 512 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1376 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 4816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 64 ms 8336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 220 ms 22152 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 550 ms 44700 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 464 ms 36596 KB Output isn't correct
2 Halted 0 ms 0 KB -