# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
485377 | Neos | Hotel (CEOI11_hot) | C++14 | 965 ms | 45108 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define PI acos(-1.0)
#define FF first
#define SS second
#define eps 1e-3
// vector
#define pb push_back
#define sz(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define lb lower_bound
#define ub upper_bound
// bit
#define CNTBIT(x) __builtin_popcount(x)
#define ODDBIT(x) __builtin_parity(x)
#define MASK(i) (1ll<<(i))
#define BIT(x, i) (((x)>>(i))&1)
#define SUBSET(big, small) (((big)&(small))==(small))
#define MINBIT(x) (x)&(-x)
// typedef
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> i3;
/* CODE BELOW */
const int N=3e3+7, M=4e5+7;
const int MOD=998244353;
const int oo=1e9+7;
int n, m, k, t;
multiset<ii> s;
signed main() {
//fastIO;
scanf("%d%d%d", &n, &m, &k);
int u, v, cnt=0;
for(int i=1;i<=n;i++) {
scanf("%d%d", &u, &v);
s.insert(ii(v, u));
}
vector<ii> q;
for(int i=1;i<=m;i++) {
scanf("%d%d", &u, &v);
q.pb(ii(-u, v));
}
sort(all(q));
ll ans=0;
vector<ll> _ans;
for(ii r:q) {
tie(u, v)=r;
auto it=s.lb(ii(v, 0));
if(it==s.end()) continue;
if(-u-it->SS<0) continue;
//ans+=-u-it->SS, cnt++;
_ans.pb(u+it->SS);
s.erase(it);
//if(cnt==k) break;
}
sort(all(_ans));
for(int i=1;i<=min(k, sz(_ans));i++) {
ans+=-_ans[i-1];
}
printf("%lld", ans);
return 0;
}
/* stuff you should look for
- int overflow, array bounds
- special/edge cases (n=1?)
- do smth instead of nothing and stay organized
- WRITE STUFF DOWN
- DONT JUST STICK ON ONE APPROACH
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |