Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main() {
- int n, a[900005], cnt=0, b[900005]={0}, j;
- scanf("%d", &n), j=n/2-1;
- for(int i=0; i<n; i++) scanf("%d", &a[i]);
- sort(a, a+n);
- for(int i=n-1; i>=0; i--) if(b[i]==0) {
- while(a[j]>a[i]/2 && j>=0) j--;
- while(b[j]==1 && j>=0) j--;
- if(j<0) break;
- if(b[j]==0 && a[j]<=a[i]/2) b[i]=b[j]=1, cnt++;
- }
- printf("%d", n-cnt);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement