#include <iostream>
												#include <string>

												using namespace std;

												struct Pyramid
												{
													float B;// lice na osnovata na piramida
													float h;// viso4ina na piramidata
													float V;// obem na piramidata
												};

												float PyramidVolume(float B, float h)
												{
													return (B*h)/3;
												}

												short int MinimalVolume(Pyramid masiv[])
												{
													float minimalVolume = masiv[0].V;
													short int index = 0;

													for (int i = 0; i < 3; i++)
													{
														if (minimalVolume < masiv[i].V)
														{
															minimalVolume = masiv[i].V;
															index = i;
														}
													}
													return index;
												}

												int main()
												{
													Pyramid pyramids[3];

													for (int i = 0; i < 3; i++)
													{
														cout << "Vyvedi lice na osnovata [B]: ";
														cin >> pyramids[i].B;
														cout << "Vyvedi Visochina na piramidata [h]: ";
														cin >> pyramids[i].h;
														cout << endl;
														pyramids[i].V = PyramidVolume(pyramids[i].B, pyramids[i].h);// iz4islqva obema na vsqka piramida
													}

													short int index = MinimalVolume(pyramids);

													cout << endl;
													cout << "Pyramid with lowest Volume is [# " << index + 1 << "]" << endl;

													return 0;
												}






#include <iostream>
#include <string>

using namespace std;

// Broi na trapecite, koito shte se vuvejdat
const int N = 3;

// Strukturata za Trapec
struct Trapec
{
	double a, b;
	double h;
};

// Namira ploshta na Trapec po podadeni strani 'a' i 'b' i visochina 'h'
double findArea(double a, double b, double h)
{
	double S = ((a + b) / 2) * h;
	return S;
}

// Namira elementa s nai-golqma plosht i vrushta negoviqt index
int findGreatestArea(double areas[])
{
	int greatestAreaIndex = 0;

	for (int i = 0; i < N; i++)
	{
		if (areas[greatestAreaIndex] < areas[i])
		{
			greatestAreaIndex = i;
		}
	}

	return greatestAreaIndex;
}

// Otpechatva krainiqt rezultat
void printResult(Trapec trapeci[], double areas[], int greatestAreaIndex)
{
	cout << "### Rezultati ###\n";
	cout << "-> Trapeca s nai-golqma plosht e s index[" << greatestAreaIndex
		<< "] i tq e `S = " << areas[greatestAreaIndex] << "`\n\n";

	for (int i = 0; i < N; i++)
	{
		cout << "# Trapec[" << i << "]\n";
		cout << "Strana `a` = " << trapeci[i].a << "\n";
		cout << "Strana `b` = " << trapeci[i].b << "\n";
		cout << "Visochina `h` = " << trapeci[i].h << "\n";
		cout << "Lice `S` = " << areas[i] << "\n\n";
	}
}

// Otpechatva suobshteniqta za greshka i zatvarq konzolata
void printError(string errorMessage)
{
	cout << "ERROR: " << errorMessage << "\n";
	system("PAUSE");
	exit(EXIT_FAILURE);
}

int main()
{
	Trapec trapeci[N]; // Masiv ot trapeci
	double areas[N]; // Masiv za ploshtite na trapecite

	for (int i = 0; i < N; i++)
	{
		cout << "Trapec[" << i << "]:\n";

		double a;
		cout << "Strana `a` = ";
		cin >> a;
		if (!cin) printError("Molq vuvedete chislo za stranata `a`!");
		if (a <= 0) printError("Vuvedete polojitelno chislo za `a`!");

		double b;
		cout << "Strana `b` = ";
		cin >> b;
		if (!cin) printError("Molq vuvedete chislo za stranata `b`!");
		if (b <= 0) printError("Vuvedete polojitelno chislo za `b`!");

		double h;
		cout << "Visochina `h` = ";
		cin >> h;
		if (!cin) printError("Molq vuvedete chislo za visochinata `h`!");
		if (h <= 0) printError("Vuvedete polojitelno chislo za `h`!");

		// Prisvoqva vuvedenite stoinosti kum tekushtiq element ot masiva
		trapeci[i].a = a;
		trapeci[i].b = b;
		trapeci[i].h = h;

		// Vzema ploshta na tekushtiq vuveden trapec i q zapazva v masiva
		areas[i] = findArea(a, b, h);

		cout << "\n";
	}
	cout << "==================================================\n\n";

	int greatestAreaIndex = findGreatestArea(areas);
	printResult(trapeci, areas, greatestAreaIndex); // Otpechatva krainiqt rezultat

	system("PAUSE");
	return 0;
}