Submission #727583

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
727583	2023-04-21 01:57:29	josanneo22	Radio (Balkan15_RADIO)	C++17	0 / 100	1 ms	340 KiB

radio

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
/*梁*/
#include <bits/stdc++.h>
using namespace std;
void solve(){
    int n,k; cin>>n>>k;
    vector<int> x(n),p(n),s(n);
    for(int i=0;i<n;i++){
        cin>>x[i]>>p[i]>>s[i];
    }
    sort(p.begin(),p.end(),[&](int i,int j){
        return x[i]<x[j];
    });
    sort(s.begin(),s.end(),[&](int i,int j){
        return x[i]<x[j];
    });
    sort(x.begin(),x.end(),[&](int i,int j){
        return x[i]<x[j];
    });
    int ans=0;
    for(int i=0;i<n;i++){
        int mx=0;
        for(int j=i+1;j<n;j++){
            mx=max(mx,max(0,abs(x[i]-x[j])-p[i]-p[j]));
        }
        ans+=mx;
    }
    cout<<ans<<'\n';
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 25