Language: Java

import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.math.BigInteger;

public class Main{

static PrintWriter out;
static InputReader ir;

static void solve(){
 int n=ir.nextInt();
 int[][] bs=new int[n][];
 for(int i=0;i<n;i++) bs[i]=ir.nextIntArray(2);
 Arrays.sort(bs,new Comparator<int[]>(){
  public int compare(int[] a,int[] b){
   return -Integer.compare(a[1],b[1]);
  }
 });
 int lb=0,ub=n+1;
 while(ub-lb>1){
  int mid=(lb+ub)/2;
  if(ok(mid,bs)) lb=mid;
  else ub=mid;
 }
 out.println(lb);
}

public static boolean ok(int m,int[][] bs){
 if(m==0) return true;
 int n=bs.length;
 PriorityQueue<Integer> pque=new PriorityQueue<>();
 long tot=0;
 for(int i=0;i<m;i++){
  pque.offer(-fs[i][0]);
  tot+=(long)fs[i][0];
 }
 if(tot<=(long)fs[m-1][1]*(long)m) return true;
 for(int i=m;i<n;i++){
  tot+=(long)pque.poll();
  tot+=(long)fs[i][0];
  if(tot<=(long)fs[i][1]*m) return true;
 }
 return false;
}

public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}

static class InputReader {
 private InputStream in;
 private byte[] buffer=new byte[1024];
 private int curbuf;
 private int lenbuf;

 public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
 
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }

 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
 
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
 
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
 
 public boolean hasNext(){skip(); return hasNextByte();}
 
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
 
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  int res=0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public long nextLong() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  long res = 0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }

 public double nextDouble(){return Double.parseDouble(next());}

 public int[] nextIntArray(int n){
  int[] a=new int[n];
  for(int i=0;i<n;i++) a[i]=nextInt();
  return a;
 }

 public long[] nextLongArray(int n){
  long[] a=new long[n];
  for(int i=0;i<n;i++) a[i]=nextLong();
  return a;
 }

 public char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}

Compiler output:
Main.java:41: error: cannot find symbol
  pque.offer(-fs[i][0]);
              ^
  symbol:   variable fs
  location: class Main
Main.java:42: error: cannot find symbol
  tot+=(long)fs[i][0];
             ^
  symbol:   variable fs
  location: class Main
Main.java:44: error: cannot find symbol
 if(tot<=(long)fs[m-1][1]*(long)m) return true;
               ^
  symbol:   variable fs
  location: class Main
Main.java:47: error: cannot find symbol
  tot+=(long)fs[i][0];
             ^
  symbol:   variable fs
  location: class Main
Main.java:48: error: cannot find symbol
  if(tot<=(long)fs[i][1]*m) return true;
                ^
  symbol:   variable fs
  location: class Main
5 errors