Pagini recente » Cod sursa (job #2132916) | Cod sursa (job #1084919) | Cod sursa (job #1671254) | Cod sursa (job #3259481) | Cod sursa (job #464667)
Cod sursa(job #464667)
#include <stdio.h>
#define Nmax 100100
int n, x[Nmax], y[Nmax];
int main() {
freopen("cadrane.in" , "r", stdin );
freopen("cadrane.out", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d", &x[i], &y[i]);
int best = 0;
for (int i = 1; i <= n; ++i) {
int MinA = 123456789;
int X = x[i];
for (int j = 1; j <= n; ++j) {
int Y = y[j];
int pctA = 0;
for (int k = 1; k <= n; ++k) {
if ( (x[k] >= X && y[k] >= Y) || (x[k] <= X && y[k] <= Y) )
++pctA;
}
if (pctA < MinA)
MinA = pctA;
}
if (MinA > best)
best = MinA;
}
printf("%d\n", best);
return 0;
for (int i = 1; i <= n; ++i) {
int MinA = 123456789;
int X = x[i];
for (int j = 1; j <= n; ++j) {
int Y = y[j];
int pctA = 0;
for (int k = 1; k <= n; ++k) {
if ( (x[k] >= X && y[k] >= Y) || (x[k] <= X && y[k] <= Y) )
++pctA;
}
if (pctA < MinA)
MinA = pctA;
}
if (MinA == best)
printf("%d %d\n", x[i], y[i]);
}
return 0;
}