분류 전체보기439 백준 11399번 C++ #include #include #include using namespace std; vector time;int n; int calmincost() {int sum = 0,answer=0;sort(time.begin(), time.end()); for (int i = 0; i > n;time.resize(n);for (int i = 0; i > time[i];}cout 2019. 2. 18. 백준 1764번 C++ #include #include #include #include using namespace std; int n, m;vector v;vector answer; int main(void) {cin >> n >> m; v.resize(n);for (int i = 0; i > v[i];}sort(v.begin(), v.end());for (int i = 0; i > name;if (binary_search(v.begin(), v.end(), name))answer.push_back(name);}sort(answer.begin(), answer.end());cout 2019. 2. 18. 백준 2960번 C++ #include #include using namespace std; const int MAX = 1003;int n, k;int arr[MAX]; int main(void) {cin >> n >> k;for (int i = 2; i 2019. 2. 18. 백준 5565번 C++ #include #include using namespace std; int sum,cost; int main(void) {cin >> sum;for (int i = 0; i > cost;sum -= cost;}cout 2019. 2. 18. 이전 1 ··· 73 74 75 76 77 78 79 ··· 110 다음
