Submission #2136274

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <iomanip>
#include <algorithm>
#include <tuple>
#include <queue>
#include <set>
#include <math.h>
#include <array>
#include <list>
#include <set>
#define MOD 1000000007
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef pair <ll,ll> pa;
typedef tuple<ll,int,int> tup;
typedef vector<pa> vp;
typedef vector<int> vi;
typedef vector<ll> vl;
set <int> st;
vector<int> videos(105);
double now=0;
queue<int> num;
ll n,p;
ll white=0,blue=0;
vp member(100005);

int main(int argc,char const* argv[])
{
  cin >> n >> p;
  int ans=n;
  member.resize(n);
  for(int i=0;i<n;i++)
    {
      cin >> member[i].first >> member[i].second;
      white+=member[i].first;
    }
  sort(member.begin(),member.end());
  for(int i=0;i<n;i++)
    {
      white-=member[i].first;
      blue+=member[i].second;
      //cout << white << ' ' << blue << endl;
      if((100-p)*white-p*blue>=0)
	{
	  ans--;
	}
    }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result