Language: C++

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef pair<int,int> P;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}


int main() {
    int n;
    cin >> n;
    int x[n][2];
    rep(i,n){
        cin >> x[i][0] >> x[i][1];
    }

    if(n==1){
        cout << '1' << endl;
        return 0;
    }

    vector<P> v;

    rep(i,n){
        rep(j,n){
            if(i!=j){
                v.push_back(P(x[i][0]-x[j][0],x[i][1]-x[j][1]));
            }
        }
    }
    sort(v.begin(),v.end());

    int count = 0;
    rep(i,v.size()){
        P p = v[i];
        count = max(count,upper_bound(v.begin(),v.end(), p) - lower_bound(v.begin(),v.end(), p));
    }

    /*
    int count = 0;
    int a,b;
    a = v[0].first;
    b = v[0].second;
    int tmp = 1;
    srep(i,1,v.size()){
        if(v[i].first==a&&v[i].second==b){
            tmp++;
        }else{
            count = max(count,tmp);
            a = v[i].first;
            b = v[i].second;
            tmp = 1;
        }
    }
    count = max(count,tmp);
     */

    int ans = n-count;

    cout << ans << endl;
    return 0;
}
 
 


Compiler output:
a.cc: In function 'int main()':
a.cc:40:20: error: no matching function for call to 'max(int&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >::difference_type)'
   40 |         count = max(count,upper_bound(v.begin(),v.end(), p) - lower_bound(v.begin(),v.end(), p));
      |                 ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:40:20: note:   deduced conflicting types for parameter 'const _Tp' ('int' and '__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >::difference_type' {aka 'long int'})
   40 |         count = max(count,upper_bound(v.begin(),v.end(), p) - lower_bound(v.begin(),v.end(), p));
      |                 ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:40:20: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   40 |         count = max(count,upper_bound(v.begin(),v.end(), p) - lower_bound(v.begin(),v.end(), p));
      |                 ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~