oj.uz

답안 #530572

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
530572 2022-02-25T20:56:53 Z FelipeH Hotel (CEOI11_hot) C++14
10 / 100
 2781 ms 8392 KB 
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;

vector<int> roomSize, roomCost;
vector<pii> offer;

int main(){
  int n, m, o; cin >> n >> m >> o;
  for(int i = 0;i<n;i++){
    int a, b; cin >> a >> b;
    roomCost.push_back(a); roomSize.push_back(b);
  }
  sort(roomCost.begin(),roomCost.end());
  sort(roomSize.begin(),roomSize.end());
  for(int i = 0;i<m;i++){
    int a, b; cin >> a >> b;
    offer.push_back(make_pair(a,b));
  }
  sort(offer.begin(),offer.end());
  long long int resp = 0;
  int cnt = 0;
  for(int i = offer.size() - 1; i >= 0 && cnt <= o; i--){
    if(roomCost.empty()) break;
    // printf("processing offer (%d,%d)\n",offer[i].first, offer[i].second);
    auto it = lower_bound(roomSize.begin(), roomSize.end(), offer[i].second);
    if(it == roomSize.end()) continue;
    int roomId = it - roomSize.begin();
    // printf("-chose room %d (%d,%d)\n",roomId, roomCost[roomId], roomSize[roomId]);
    if(offer[i].first - roomCost[roomId] > 0){
      resp += offer[i].first - roomCost[roomId];
      roomCost.erase(roomCost.begin() + roomId); roomSize.erase(roomSize.begin() + roomId);
      cnt++;
    }
  }
  cout << resp << "\n";
  return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 113 ms 1244 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 411 ms 1956 KB Output is correct
2 Incorrect 164 ms 3212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2781 ms 3996 KB Output is correct
2 Incorrect 305 ms 5860 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2600 ms 7588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1026 ms 8392 KB Output isn't correct
2 Halted 0 ms 0 KB -