# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463459 | vanic | Sure Bet (CEOI17_sure) | C++14 | 120 ms | 3524 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;
const int maxn=1e5+5;
double a[maxn], b[maxn];
bool cmp(double x, double y){
return x>y;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed;
cout << setprecision(4);
int n;
cin >> n;
for(int i=0; i<n; i++){
cin >> a[i] >> b[i];
}
sort(a, a+n, cmp);
sort(b, b+n, cmp);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |