Pagini recente » Cod sursa (job #2913659) | Cod sursa (job #1745807) | Cod sursa (job #69355) | Cod sursa (job #2601435) | Cod sursa (job #553447)
Cod sursa(job #553447)
#include <iostream.h>
#include <fstream.h>
int min = 32000, x, y, n, m[2][100000];
int main()
{
ifstream f ("cadrane.in");
ofstream g ("cadrane.out");
int i, j, s, k;
f >> n;
for(i = 0; i < n; i ++)
f >> m[0][i] >> m[1][i];
for(i = 0; i < n; i ++)
for(j = 0; j < n; j ++)
{
s = 0;
for(k = 0; k < n; k ++)
{
if(m[0][i] <= m[0][k] && m[1][i] <= m[1][k])
s ++;
if(m[0][i] >= m[0][k] && m[1][i] >= m[1][k])
s ++;
}
if(min > s)
min = s;
}
g << min;
f.close();
g.close();
}