# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34190 | nibnalin | Palembang Bridges (APIO15_bridge) | C++14 | 689 ms | 16648 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 <vector>
#include <algorithm>
#include <set>
using namespace std;
typedef long long int lli;
const lli maxn = lli(1e5)+5, inf = lli(1e17)+5;
lli n, S[maxn], T[maxn], pref[maxn], suff[maxn], psum, asum;
vector<pair<lli, lli>> A;
multiset<lli> peeche, aage;
inline bool cmp(pair<lli, lli>& a, pair<lli, lli>& b)
{
return (a.first+a.second < b.first+b.second);
}
void daalo(lli v)
{
if(peeche.empty())
{
peeche.insert(v), psum += v;
return;
}
if(v < *peeche.rbegin()) peeche.insert(v), psum += v;
else aage.insert(v), asum += v;
Compilation message (stderr)
# | 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... |