| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1333950 | killerzaluu | Astronomer (BOI23_astronomer) | C++20 | 0 ms | 344 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
