B. Physics Practical:题目
太简单的题目了,和dp没啥关系
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> a((int)6e5);
vector<int> b((int)6e5), c[(int)6e5];
const int mod = 1e9 + 7;
signed main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
int n;
cin>>n;
for (int i=0;i<n;i++) cin>>a[i];
sort(a.begin(),a.begin()+n);
int res = 0;
for (int i=0;i<n;i++)
{
int k = lower_bound(a.begin(),a.begin()+n,a[i]*2+1)-a.begin();
res = max(res,(int)(k-i));
}
cout<<n-res<<endl;
}