Submission #4018749

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<stack>
#include<queue>
#include<bitset>

#define ipair pair<int,int>
#define rep(i,n) for(i=0;i<n;i++)

using namespace std;

typedef long long int lli;
typedef vector<int> vi;

int main() {
	int i, j, k, n;
	vi a;

	cin >> n;
	a.resize(n);
	rep(i, n) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());

	k = n;
	rep(i, k) {
		j = a[i] * 2;
		if (binary_search(a.begin(), a.end(), j)) {
			a.erase(a.begin() + i);
			k--;
			i--;
		}
	}

	cout << k;

	return 0;
}

Submission Info

Judge Result