Minimum of stack

#include <iostream> #include <string> using namespace std; struct stack { ​int arr[5]; ​int top; } s; void push(stack & s, int x); void min(stack s); int main() { ​int k; ​[login to view URL] = -1; ​bool n = true; ​while (n) ​{ ​​int m; ​​cin >> m; ​​switch (m) ​​{ ​​case 1: ​​​cin >>k; ​​​push(s, k); ​​​break; ​​case 2: ​​​min(s); ​​​break; ​​default: break; ​​} ​​cout << " \n Do you want to cotin....? press 1 or 0" << endl; ​​cin >> n; ​} } void push(stack & s, int x) { ​if ([login to view URL] == 4) ​{ ​​return; ​} ​else ​{ ​​s.top++; ​​[login to view URL][[login to view URL]] = x; ​} } void min(stack s) { ​int z; ​if ([login to view URL] == -1) ​{ ​​cout << "error"; ​} ​else ​{ ​​z = [login to view URL][0]; ​​for (int i = 0; i<[login to view URL]; i++) ​​{ ​​​if ([login to view URL][i] < z) ​​​{ ​​​​z = [login to view URL][i]; ​​​} ​​} ​} ​cout << "min is " << z; }