Cod sursa(job #3298575)
Utilizator | Data | 31 mai 2025 12:28:25 | |
---|---|---|---|
Problema | Infasuratoare convexa | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
struct ura
{
float x,y;
};
ura v[120005],A,B,C;
bool cmp(ura a, ura b)
{
if(a.x<b.x)
return true;
else if(a.y<b.y)
return true;
return false;
}
stack<float> st;
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i].x>>v[i].y;
sort(v+1,v+n+1,cmp);
A.x=v[1].x;
A.y=v[1].y;
B.x=v[n].x;
B.y=v[n].y;
for(int i=2;i<n;i++)
{
C.x=v[i].x;
C
}
return 0;
}