some problem about division

[booood]

Hi,
I am confusing with the problem about duplicate top divisions. If the output of the North East and South East are the same, what can I do in the code?

Thank you

#include <iostream>
#include <string>
using namespace std;
float input_div(string);
void findHighRev(float, float, float, float);
int stop;
float entry;
int main()
{
        float nE, sE, nW, sW;

        nE = input_div( "North East" );         
        sE = input_div( "South East" );         
        nW = input_div( "North West" );         
        sW = input_div( "South West" );         

        findHighRev(nE, sE, nW, sW);  
        return 0;
}



float input_div(string name)
{
float entry;
entry = -1;
  
  
while (entry < 0){    
  cout <<"Enter a positive number\n";
     cout << "Enter the sales for " << name << " division: $";
   cin >> entry;}



     return entry;
}


void findHighRev (float nE, float sE, float nW, float sW)
{

  string name;
  float highest;
  highest = nE;
  name = "North East";

        if(sE > highest)
      {
                highest = sE;
                name = "South East";
      }

        if(nW > highest)
      {
                highest = nW;
                name = "North West";
      }

        if(sW > highest)
      {
                highest = sW;
                name = "South West";
      }

        cout << "the highest is " << name << " with" << highest << "\n\n";
        cin >> stop;
} 

[jonnin]

you can print both, or you can print whichever you want. what do you want the program to do? Before you can code it, you have to know what you want to do.

one way to fix it here is if nW == highest name+= " and North West" else if(nW>highest) //as before.

if you do it right it will work; if the highest are multiple it will append them and if something new is bigger, it discards and starts over with an assignment.