Submission #3010252

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

ll X[100011];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n,p;
	cin>>n>>p;
	ll sum=0;
	for(int i=0;i<n;i++)
	{
		ll w,b; cin>>w>>b;
		sum+=-ll(p)*b;
		X[i]=ll(p)*b+ll(100-p)*w;
	}
	sort(X,X+n);
	reverse(X,X+n);
	for(int i=0;i<n;i++)
	{
		sum+=X[i];
		if(sum>=0)
		{
			cout<<i+1<<'\n';
			return 0;
		}
	}
}	

Submission Info

Judge Result