# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483153 | kawaii | Cake 3 (JOI19_cake3) | C++14 | 1 ms | 332 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.
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, v[1000005], c[1000005], ans = 0;
struct num{
int diff, V, C;
num();
num(int A, int B, int D){
diff = A, V = B, C = D;
}
};
bool operator < (num a, num b){
return a.diff < b.diff;
}
vector<num> vec;
vector<int> p;
void solve(){
sort(vec.begin(), vec.end());
for(int i = vec.size() - 1; i >= vec.size() - m; i--){
ans += vec[i].V;
p.push_back(vec[i].C);
}
sort(p.begin(), p.end());
for(int i = 0; i < p.size(); i++){
if(i == 0) ans -= abs(p[i] - p.back());
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... |