공부하는 개발자 핑구 🐧 공부하는 개발자 핑구 🐧

#include #include #include using namespace std; int main(){ vector K; vector J; K.push_back(1); K.push_back(5); K.push_back(4); //resize를 꼭 해주어야 segmentation fault 발생 방지 J.resize(K.size()); copy(K.begin(), K.end(), J.begin()); }

#include #include #include using namespace std; struct cow{ int cow_no; char grade; int profit; }; typedef vector COW; struct Find{ char grade; bool operator()(cow meooo) { return (meooo.grade == grade); } }; cow CREATE_cow(int cow_no, char grade, int profit){ cow c; c.cow_no = cow_no; c.grade = grade; c.profit = profit; return c; } int main(){ COW cows; cows.push_back(CREATE_cow(5,'A',400)); co..

#include #include #include using namespace std; struct job{ int job_no; int deadline; int profit; }; typedef vector JOB; job CREATE_job(int job_no, int deadline, int profit){ job j; j.job_no = job_no; j.deadline = deadline; j.profit = profit; return j; } int main(){ int i=0; JOB jobs; jobs.push_back(CREATE_job(1,3,40)); jobs.push_back(CREATE_job(2,2,50)); jobs.push_back(CREATE_job(3,3,20)); jobs..

#include #include #include using namespace std; struct job{ int job_no; int deadline; int profit; }; typedef vector JOB; int COMP_BY_DEADLINE(job x, job y){ return x.deadliney.profit; // x가 y보다 더 크도록 정렬 (decreasing order) } int COMP_CUSTOM(job x, job y){ if(x.deadline == y.deadline){ return x.job_no < y.job_no; } return x.deadline