# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
500124 | 2021-12-30T10:45:28 Z | beaconmc | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KB |
#include "ricehub.h" #include <bits/stdc++.h> typedef long long ll; #define FOR(i, x, y) for(ll i=x; i<y; i++) using namespace std; ll besthub(int r, int l, int x[], ll b){ sort(x, x+r); return 0; }