# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39786 | 14kg | Palembang Bridges (APIO15_bridge) | C++11 | 96 ms | 6676 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 <stdio.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <functional>
#define N 100002
#define INF 999999999999999999
#define min2(x,y) (x<y?x:y)
using namespace std;
int n, K;
long long dp1[N], dp2[N];
pair<int, int> in[N];
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > Q1;
priority_queue<pair<int, int> > Q2;
bool cmp(pair<int, int> x, pair<int, int> y) {
return x.first + x.second < y.first + y.second;
}
int main() {
//freopen("input.txt", "r", stdin);
int k, x, y;
char in_a, in_b;
long long R = 0;
scanf("%d %d ", &K, &k);
while (k--) {
scanf("%c %d %c %d ", &in_a, &x, &in_b, &y);
if (x > y) x += y, y = x - y, x -= y;
R += (long long)(y - x);
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... |