Cod sursă (job #816363)

#include <bits/stdc++.h>

using namespace std;

ifstream fin("infasuratoare.in");
ofstream fout("infasuratoare.out");

#define MAX_N 100000
#define MAX_X_Y 1000000000

int m[MAX_N + 1][2], stiva[MAX_N + 1], k = 1;

int delta(int x0, int y0, int x1, int y1, int x2, int y2)
{
    int rezultat = x0 * y1 + x2 * y0 + x1 * y2 - x2 * y1 - x0 * y2 - x1 * y0;


}

int main()
{
    int n, i, y_min, x_min;

    y_min = x_min = MAX_X_Y;

    fin >> n;

    for(i = 1; i <= n; i++)
    {
        fin >> m[i][1] >> m[i][2];

        if(m[i][1] < x_min)
            x_min = m[i][1];
        if(m[i][2] < y_min)
            y_min = m[i][2];

    }

    return 0;
}