| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 727486 | beaconmc | Hotel (CEOI11_hot) | C++14 | 1418 ms | 78352 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
//{capacity, cost}
vector<vector<ll>> stuff;
vector<ll> profit;
int main(){
ll n,m,o;
cin >> n >> m >> o;
FOR(i,0,n){
ll a,b;
cin >> a >> b;
stuff.push_back({b,a});
}
FOR(i,0,m){
ll a,b;
cin >> a >> b;
stuff.push_back({b,-a});
}
sort(stuff.begin(), stuff.end());
ll cur = 0;
FOR(i,0,stuff.size()){
if (i!=0 && stuff[i][1] * stuff[i-1][1] < 0){
cur++;
}
stuff[i][0] = cur;
}
sort(stuff.begin(), stuff.end());
reverse(stuff.begin(), stuff.end());
multiset<ll> idk;
for (auto&i : stuff){
if (i[1] < 0 && idk.size() > 0){
profit.push_back(-i[1]-(*idk.begin()));
idk.erase(*idk.begin());
}else{
idk.insert(i[1]);
}
}
sort(profit.begin(), profit.end());
reverse(profit.begin(), profit.end());
ll ans = 0;
FOR(i,0,min((ll) o, (ll) profit.size())){
ans += profit[i];
}
cout << ans;
}컴파일 시 표준 에러 (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... | ||||
