제출 #1024234

#제출 시각아이디문제언어결과실행 시간메모리
1024234vaneaDetecting Molecules (IOI16_molecules)C++14
100 / 100
69 ms15032 KiB
#include <bits/stdc++.h> #include "molecules.h" using namespace std; using ll = long long; vector<int> find_subset(int l, int u, vector<int> w) { set<pair<int, int>> s; vector<pair<ll, int>> v; int n = w.size(); for(int i = 0; i < n; i++) { v.push_back({w[i], i}); } sort(v.begin(), v.end()); ll sum = 0; for(int i = 0; i < n; i++) { sum += v[i].first; s.insert(v[i]); if(sum > u) { sum -= s.begin()->first; s.erase(s.begin()); } if(sum >= l && sum <= u) { vector<int> res; for(auto it : s) res.push_back(it.second); return res; } } return {}; } /* int main() { vector<int> ans = find_subset(15, 17, {6, 8, 8, 7}); for(auto it : ans) { cout << it << ' '; } }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...