Pagini recente » Cod sursa (job #1453546) | Istoria paginii runda/hlo-2023-cls9-tema0 | Cod sursa (job #1639366) | Cod sursa (job #906640) | Cod sursa (job #2293492)
#define MIN 0
#define MAX 1
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("poligon.in");
ofstream cout ("poligon.out");
vector < pair < int, int > > xOy;
int n, m, auxX, auxY, x[2], y[2], stoles;
int main()
{
cin>>n>>m;
for(int i = 0; i < (n + m); i++)
{
cin>>auxX>>auxY;
xOy.push_back(make_pair(auxX, auxY));
}
cin.close();
x[MIN] = auxX; x[MAX] = auxX;
y[MIN] = auxY; y[MAX] = auxY;
for(int i = 0; i < n; i++)
{
x[MIN] = min(x[MIN], xOy.at(i).first);
x[MAX] = max(x[MAX], xOy.at(i).first);
y[MIN] = min(y[MIN], xOy.at(i).second);
y[MAX] = max(y[MAX], xOy.at(i).second);
}
for(int i = n; i < m; i++)
if((xOy.at(i).first <= x[MAX] && xOy.at(i).first >= x[MIN]) && (xOy.at(i).second <= y[MAX] && xOy.at(i).second >= y[MIN]))
stoles++;
cout<<stoles;
cout.close();
return 0;
}