Submission #1333950

#TimeUsernameProblemLanguageResultExecution timeMemory
1333950killerzaluuAstronomer (BOI23_astronomer)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h> 
using namespace std;

int main() {
  long long n,k,i; 
  long double s,t;
  cin>>k>>n>>s>>t;
  
  long long a[n+1], b[n+1], sad[n+1];
  
  for(i=1; i<=n; i++) {
    cin>>a[i]>>b[i];
  }
  long double e=0.00000001;
  if(t<=s+e) {
    for(i=1; i<=n; i++) {
      sad[i]=a[i]*a[i]+b[i]*b[i];
    }
    
    
    sort(sad+1, sad+n+1);
    
    cout<<(long double) sqrt((long double) sad[n+1-k])*t<<endl;
  }
  
  
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...