Eroare de compilare: user.cpp:5:141: error: conflicting declaration ‘int p [501]’ int step,r,max,min,i,n,m,t,j,k,l,x[2000001],y[200001],z[200001],w[200001],e[2500001],g[250001],p[200001],s[200001],o[250001],q[250001],p[501],nou[200001],h[501]; ^ user.cpp:5:96: error: ‘p’ has a previous declaration as ‘int p [200001]’ int step,r,max,min,i,n,m,t,j,k,l,x[2000001],y[200001],z[200001],w[200001],e[2500001],g[250001],p[200001],s[200001],o[250001],q[250001],p[501],nou[200001],h[501]; ^ user.cpp: In function ‘int main()’: user.cpp:38:28: error: ‘struct std::pair<int, int>’ has no member named ‘x’ scanf("%d%d",&a[i].x,&a[i].y),p[i]=h[i]=i; ^ user.cpp:38:36: error: ‘struct std::pair<int, int>’ has no member named ‘y’ scanf("%d%d",&a[i].x,&a[i].y),p[i]=h[i]=i; ^ user.cpp:42:13: error: ‘struct std::pair<int, int>’ has no member named ‘y’ if(a[i].y!=a[j].y) ^ user.cpp:42:21: error: ‘struct std::pair<int, int>’ has no member named ‘y’ if(a[i].y!=a[j].y) ^ user.cpp:43:24: error: ‘struct std::pair<int, int>’ has no member named ‘x’ d[k]=1.0*(a[i].x-a[j].x)/(a[j].y-a[i].y),o[k]=a[i].y<a[j].y?i:j,q[k]=j+i-o[k],k++; ^ user.cpp:43:31: error: ‘struct std::pair<int, int>’ has no member named ‘x’ d[k]=1.0*(a[i].x-a[j].x)/(a[j].y-a[i].y),o[k]=a[i].y<a[j].y?i:j,q[k]=j+i-o[k],k++; ^ user.cpp:43:40: error: ‘struct std::pair<int, int>’ has no member named ‘y’ d[k]=1.0*(a[i].x-a[j].x)/(a[j].y-a[i].y),o[k]=a[i].y<a[j].y?i:j,q[k]=j+i-o[k],k++; ^ user.cpp:43:47: error: ‘struct std::pair<int, int>’ has no member named ‘y’ d[k]=1.0*(a[i].x-a[j].x)/(a[j].y-a[i].y),o[k]=a[i].y<a[j].y?i:j,q[k]=j+i-o[k],k++; ^ user.cpp:43:60: error: ‘struct std::pair<int, int>’ has no member named ‘y’ d[k]=1.0*(a[i].x-a[j].x)/(a[j].y-a[i].y),o[k]=a[i].y<a[j].y?i:j,q[k]=j+i-o[k],k++; ^ user.cpp:43:67: error: ‘struct std::pair<int, int>’ has no member named ‘y’ d[k]=1.0*(a[i].x-a[j].x)/(a[j].y-a[i].y),o[k]=a[i].y<a[j].y?i:j,q[k]=j+i-o[k],k++; ^ user.cpp:45:42: error: reference to ‘min’ is ambiguous scanf("%d%d%d",&j,&r,&z[i]),x[i]=min(j,r),y[i]=max(j,r),w[i]=i; ^ user.cpp:5:16: note: candidates are: int min int step,r,max,min,i,n,m,t,j,k,l,x[2000001],y[200001],z[200001],w[200001],e[2500001],g[250001],p[200001],s[200001],o[250001],q[250001],p[501],nou[200001],h[501]; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:4249:5: note: template<class _Tp, class _Compare> _Tp std::min(std::initializer_list<_Tp>, _Compare) min(initializer_list<_Tp> __l, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algo.h:4244:5: note: template<class _Tp> _Tp std::min(std::initializer_list<_Tp>) min(initializer_list<_Tp> __l)