Submission #727574

#TimeUsernameProblemLanguageResultExecution timeMemory
727574josanneo22Radio (Balkan15_RADIO)C++17
0 / 100
1 ms212 KiB
/*梁*/ #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]; } vector<int> order(n);iota(order.begin(),order.end(),0); sort(order.begin(),order.end(),[&](int i,int j){ return x[i]+p[i]<x[j]+p[j]; }); int mx=x[order[0]]+p[order[0]]; int ans=0; for(int i=1;i<n;i++){ ans+=max(0,x[order[i]]-p[order[i]]-mx); } cout<<ans<<'\n'; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...