Question

C++ question

I'm trying to write a code that takes in n number of variables between 00 and 99. The program should be able to output the 1st and 2nd lowest digits as well as the highest and second highest digits. So if the input is 4 - 50 20 10 70 it should output 10 20 50 70. I think I've gotten the basic code but I can't seem to get the last digit to shift.

#include <iostream>
#include <iomanip>

using namespace std;

int main ()
{
int n, m1, m2, m3, m4;
int temp;
int newval;

cin >> n;

for (int i = 1; i <= n; i++)
    {
      cin >> newval;
    
      if(newval <= 50)
      {
      m4 = newval;
      if(newval < m1)
         m2 = m1;
         m1 = newval;
      }
       
      if(newval > 50)
      {
      m4 = newval;
      if(newval > m4)
         m4 = m3;
         m3 = newval;
      }
   }
      cout << m1 << endl;
      cout << m2 << endl;
      cout << m3 << endl;
      cout << m4 << endl;

return 0;
}

Answer 1

Code:

#include <iostream>
#include <limits> // for numeric_limits
#include <cstdlib> // for exit()

using namespace std;

int main ()
{
// number of variables
int n;

cout << "Enter number of variables(min 2): ";
cin >> n;
// exit if size < 2
if(n < 2) {
exit(1);
}

// first store all the values in an array
int *array = new int[n];

for (int i = 0; i < n; i++)
{
// input array elements
cin >> array[i];
}
// define the four elements
int lowest = numeric_limits<int>::max();
int secondLowest = numeric_limits<int>::max();
int highest = numeric_limits<int>::min();
int secondHighest = numeric_limits<int>::min();

for (int i = 0; i < n; i++) {
// check if array[i] is smaller than the current lowest elements
if(array[i] < lowest) {
// then the lowest becomes the second lowest
secondLowest = lowest;
// assign lowest
lowest = array[i];
}
// check if array[i] is between current lowest and current secondLowest
// update secondLowest
else if(array[i] < secondLowest && array[i] != lowest) {
secondLowest = array[i];
}

if(array[i] > highest) {
secondHighest = highest;
highest = array[i];
}
else if(array[i] > secondHighest && array[i] != highest) {
secondHighest = array[i];
}
}
cout << "Lowest: " << lowest << endl;
// if all elements are not the same
if(secondLowest != numeric_limits<int>::max())
cout << "Second Lowest: " << secondLowest << endl;
// if all elements are not the same
if(secondHighest != numeric_limits<int>::min())
cout << "Second Highest: " << secondHighest << endl;
cout << "Highest: " << highest << endl;

delete array;
return 0;
}

OUTPUT:

Screens: