ＷＡ

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int N , T;
struct node{
	int m , v;
	bool operator<(node nxt) const{
		return nxt.v > v ;
	}
}A[1000];
double cnt = 0;
int main()
{
   cin >> N >> T ;
	for(int i = 1 ; i <= N ; i++)
		cin >> A[i].m >> A[i].v ;
	int w = 1;
	for(int i = 1 ; i <= N ; i++)
	{
		if(A[w].m  <=  T )
			cnt += A[w].v  , cnt *= 1.00;
		else break;
	}
	printf("%.2lf",cnt * 1.00);
	return 0;
}