제출 #115339

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115339		model_code	Hotel (CEOI11_hot)	C++17	70 / 100	4086 ms	10464 KiB

hot

/* Slow solution for task HOT
 * Author: Miroslaw Michalski
 * 24APR11
 * linear search
 */
#include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

const int INF = 1100000000;

int main() {
  int n, m, o, ci, pi;
  long long res = 0;
  vector<int> think;
  vector<pair<int, int> > v;
  scanf("%d%d%d", &n, &m, &o);
  for(int i = 0; i < n; i++) {
    scanf("%d%d", &ci, &pi);
    pair<int, int> obj = make_pair(pi, ci);
    v.push_back(obj);
  }
  sort(v.begin(), v.end());
  
  vector<pair<int, int> > q;
  for(int i = 0; i < m; i++) {
    scanf("%d%d", &ci, &pi);
    q.push_back(make_pair(ci, pi));
  }
  sort(q.begin(), q.end());
  reverse(q.begin(), q.end());
  
  for(int i = 0; i < m; i++) {
    ci = q[i].first;
    pi = q[i].second;
    for(size_t j = 0; j < v.size(); j++) {
      if (v[j] > make_pair(pi, -1)) {
        if (v[j].second < ci) {
          think.push_back(ci - v[j].second);
        }
        v[j] = make_pair(-INF, -INF);
        break;
      }
    }
  }
  sort(think.begin(), think.end());
  reverse(think.begin(), think.end());
  o = min(o, static_cast<int>(think.size()));
  for(int i = 0; i < o; i++) {
    res += think[i];
  }
  printf("%lld\n", res);
}

컴파일 시 표준 에러 (stderr) 메시지

hot.cpp: In function 'int main()':
hot.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &n, &m, &o);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
hot.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &ci, &pi);
     ~~~~~^~~~~~~~~~~~~~~~~~
hot.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &ci, &pi);
     ~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10