Source:
#include < iostream >
Header #include <algorithm> // array for arrangement
#define N 5
using namespace std;
void main()
{
float *p,sum=0;
int i;
p = new float[N];
cout << "15 float type input values:" << endl;
for (i = 0; i < N; i++)
{
cin >> *(p + i);
sum = sum + *(p+i);
}
for (i = 0; i < N; i++)
{
cout << *(p + i) << ",";
}
cout << endl;
cout << "和为:"<<sum << endl;
sort (p, p + N); // use ascending sort of way,
cout << "\ n is a minimum:" << * (p) << endl; // first value is a minimum value i.e.
delete p;
system("pause");
}
operation result: