# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
276612 | arnold518 | Radio (Balkan15_RADIO) | C++14 | 1 ms | 256 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1000;
struct Data
{
int X, P, S;
};
int N, K;
Data A[MAXN+10];
int main()
{
scanf("%d%d", &N, &K);
for(int i=1; i<=N; i++) scanf("%d%d%d", &A[i].X, &A[i].P, &A[i].S);
if(N==1) return !printf("0\n");
ll ans=1e18;
for(int i=1; i<N; i++)
{
vector<ll> V; int cnt=0;
for(int j=1; j<=i; j++) V.push_back(A[j].X+A[j].P);
for(int j=i+1; j<=N; j++) V.push_back(A[j].X-A[j].P), cnt++;
sort(V.begin(), V.end());
ll k=V[cnt-1];
ll now=0;
for(int j=1; j<=i; j++) now+=max(0ll, k-A[j].X-A[j].P);
for(int j=i+1; j<=N; j++) now+=max(0ll, A[j].X-A[j].P-k);
ans=min(ans, now);
}
printf("%lld\n", -ans);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |