# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225413 | gilles_deleuze | Candies (JOI18_candies) | C++17 | 599 ms | 29816 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 <bits/stdc++.h>
using namespace std;
void solve(std::istream &in, std::ostream &out);
int main() {
#ifdef LOCAL
freopen("../IO/f.in", "r", stdin);
// freopen("../IO/f.out", "w", stdout);
#else
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
#endif
solve(std::cin, std::cout);
return 0;
}
void solve(std::istream &in, std::ostream &out) {
int n;
in >> n;
vector<int> a(n);
for (int &i : a) in >> i;
set<pair<int64_t, int>, greater<>> costs;
set<pair<int, int64_t>> segs;
for (int i = 0; i < n; ++i) {
costs.emplace(a[i], i);
segs.emplace(i, a[i]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |