Codeforces Round #242 (Div. 2) B. Megacity

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <map>
using namespace std;

int main(){
    int n,s;
    cin >> n >>s;
    map<double,int> a;
    for(int i = 0 ; i < n ; ++ i){
        double x,y;
        int people;
        cin>> x >>y>>people;
        double r = x*x+y*y;
        if(a.find(r)!=a.end()) a[r]+=people;
        else a.insert(make_pair(r,people));
    }
    map<double,int>::iterator iter = a.begin();
    for(; iter!=a.end(); iter++){
        s+=iter->second;
        if(s >= 1000000) break;
    }
    if(iter==a.end())cout<<-1<<endl;
    else printf("%0.6f\n",sqrt(iter->first));
}