제출 #1006882

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006882		makanhulia	Cloud Computing (CEOI18_clo)	C++17	54 / 100	219 ms	1372 KiB

clo

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, inf = 1e15;
priority_queue<pair<pair<int, int>, pair<int, int>>> pq;
int dp[200005];
int c, f, v, a, ran = 0;
signed main() {
  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  for(int i = 1; i <= 100000; i++) {
    dp[i] = inf;
  }
  cin >> n;
  for(int i = 0; i < n; i++) {
    cin >> c >> f >> v;
    pq.push({{f, c}, {v, 2}});
  }
  cin >> m;
  for(int i = 0; i < m; i++) {
    cin >> c >> f >> v;
    pq.push({{f, c}, {v, 1}});
  }
  
  while(!pq.empty()) {
    c = pq.top().first.second;
    v = pq.top().second.first;
    a = pq.top().second.second;
    pq.pop();
    if(a == 2) {
      for(int i = 100000; i >= 0; i--) {
        dp[i + c] = min(dp[i + c], dp[i] + v);
      }
      
      ran += c;
    } else {
      for(int i = c; i <= 100000; i++) {
        dp[i - c] = min(dp[i - c], dp[i] - v);
      }
    }
  }
  int mini = 0;
  for(int i = 0; i <= 100000; i++) {
    mini = min(dp[i], mini);
  }
  mini *= -1;
  cout << mini << "\n";
}

• Subtask 1: 18 / 18
• Subtask 2: 0 / 18
• Subtask 3: 18 / 18
• Subtask 4: 0 / 18
• Subtask 5: 18 / 18
• Subtask 6: 0 / 10