#include <iostream> #include <stack> #include <vector> #include <algorithm> using namespace std; int main() { stack<int> s; for(int i=1;i<=10;i++) s.push(i*5) ; cout << "Initial Stack Size: " << s.size() << endl; while(!s.empty()) { cout << "Top: " << s.top() << endl; s.pop(); } vector<int> arr = {5,3,9,1,6,8}; sort(arr.begin(), arr.end()); cout << "Sorted: "; for(auto v : arr) cout << v << " "; cout << endl; vector<int> rev(arr.rbegin(), arr.rend()); cout << "Reversed: "; for(auto v : rev) cout << v << " "; cout << endl; int sum = 0; for(auto v : arr) sum += v; cout << "Sum: " << sum << endl; cout << "Average: " << (double)sum / arr.size() << endl; cout << "Program Completed" << endl; return 0; }