뚠토리

#include #include #include #include #include #include using namespace std; std::queue Q; int main() { std::ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N; cin >> N; for (int i = 0; i > tmp; if (tmp == "push") { int num; cin >> num; Q.push(num); } else if (tmp == "pop") { if (Q.empty()) { cout

#include #include #include #include using namespace std; vector V; int main(void) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N; cin >> N; for (int i = 0;i > num; V.push_back(num); } sort(V.begin(), V.end()); int M; cin >> M; for (int i = 0;i > target; cout

#include #include #include #include #include #include using namespace std; std::stack S; int main() { std::ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N; cin >> N; for (int i = 0; i > tmp; if (tmp == "push") { int num; cin >> num; S.push(num); } else if (tmp == "pop") { if (S.empty()) cout

#include #include #include #include using namespace std; int main(void) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int ar[10001] = { 0 }; int N; cin >> N; for (int i = 0;i > num; ar[num]++; } for (int i = 1;i < 10001;i++) { for (int j = 0;j < ar[i];j++) { cout

#include #include #include #include //이진탐색 using namespace std; int N, M; vector V; int Binary_Search(int low, int high, int target) { if (low > high) { return 0; } else { int mid = (low + high) / 2; if (V[mid] == target) { return 1; } else if (V[mid] > target) { return Binary_Search(low, mid - 1, target); } else { return Binary_Search(mid + 1, high, target); } } } int main(void) { std::ios_base..

#include #include #include #include using namespace std; vector V; int main(void) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N; cin >> N; for (int i = 0;i > num; V.push_back(num); } sort(V.begin(), V.end()); for (auto& i : V) { cout