vectors

[MeriemMer]

Hi

[Auroch]

Declare a minimal value to the first pair of coordinates. Then compare it with other points using i-counter in a for-loop. If (pair < min) min = pair. Multimap associative container can be used to make pair. You can use usual static array point[x][y] too.

[Auroch]

It's exemplary scheme using static array (without multimap pair):

min =point[1][1];
for (i = 2; i <= n; i++) {
      for (j = 2; j <= n; j++) {

  if (a[i] [j] > min) min = a[i] [j];

  }
}
printf("minimal coordinates: %i\n",min);

[keskiverto]

the point with the lowest side

What does that mean?

[Auroch]

I've considered that it's point with minimal coordinates. Is it?

[MeriemMer]

yes it is, but i have to work withe vectors not arrays

[keskiverto]

"Minimal" as in what? Closest to point (0,0)? Or perhaps (-1000,2) is "less" than (0,1)?

Vector is just a dynamic, sugar-coated array. Its documentation on this site has examples of use.

struct Point {
  float x;
  float y;
};

bool lower( Point a, Point b ) {
  // return true if a is lower than b
}

int main() {
  std::ifstream fin("input.txt");
  Point p;
  std::vector<Point> data;
  data.reserve(50);
  while ( fin >> p.x >> p.z ) {
    // append p to data
  }
  if ( /*data has points*/ ) {
    std::sort( begin(data), end(data), lower );
    // show the winner
  }
  return 0;
}

[MeriemMer]

minimial as the lowest one in all the points in the file