oj.uz

Submission #143206

# Submission time Handle Problem Language Result Execution time Memory
143206 2019-08-13T10:57:59 Z popovicirobert Hotel (CEOI11_hot) C++14
30 / 100
 846 ms 24852 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long



/*const int MOD = ;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}*/

/*int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}*/

using namespace std;



int main() {
#if 0
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, n, m, o;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> m >> o;
    set < pair <int, int> > room;
    for(i = 0; i < n; i++) {
        int c, p;
        cin >> c >> p;
        room.insert({p, c});
    }
    vector < pair <int, int> > offer(m);
    for(i = 0; i < m; i++) {
        cin >> offer[i].first >> offer[i].second;
    }
    sort(offer.rbegin(), offer.rend());

    vector <int> vals;
    for(i = 0; i < m; i++) {
        auto it = room.lower_bound({offer[i].second, 0});
        if(it == room.end()) {
            continue;
        }
        vals.push_back(offer[i].first - it -> second);
        room.erase(it);
    }
    sort(vals.rbegin(), vals.rend());

    ll ans = 0;
    for(i = 0; i < vals.size() && i < o; i++) {
        ans += max(vals[i], 0);
    }
    cout << ans;

    return 0;
}

Compilation message

hot.cpp: In function 'int main()':
hot.cpp:99:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i = 0; i < vals.size() && i < o; i++) {
                ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct

Subtask #5
10.0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 3364 KB Output isn't correct

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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