# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
773083 |
2023-07-04T14:52:17 Z |
NK_ |
Hotel (CEOI11_hot) |
C++17 |
|
406 ms |
49908 KB |
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define f first
#define s second
#define mp make_pair
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
using ll = long long;
using pi = pair<int, int>;
template<class T> using V = vector<T>;
int main() {
cin.tie(0)->sync_with_stdio(0);
int N, M, O; cin >> N >> M >> O;
V<pi> A(N); for(auto& x : A) cin >> x.f >> x.s;
V<pi> B(M); for(auto& x : B) cin >> x.f >> x.s;
sort(all(A));
sort(all(B));
set<pi> S; for(int i = 0; i < N; i++) S.insert(mp(A[i].s, i));
V<int> P;
for(int i = 0; i < M; i++) {
auto it = S.lower_bound(mp(B[i].s, -1));
if (it == end(S)) continue;
int j = (*it).s;
P.push_back(B[i].f - A[j].f);
S.erase(it);
}
sort(all(P));
ll ans = 0;
for(int i = 0; i < min(O, sz(P)); i++) ans += max(0, P[i]);
cout << ans << nl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
1236 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
4724 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
65 ms |
7796 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
182 ms |
21536 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
375 ms |
42888 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
406 ms |
49908 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |