제출 #1195488

#제출 시각아이디문제언어결과실행 시간메모리
1195488ozner77Bulldozer (JOI17_bulldozer)C++17
5 / 100
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int main(){ ll n; ll x,y,w; map<ll,ll> M; vector<ll> V; cin>>n; for(ll i=0;i<n;i++){ cin>>x>>y>>w; M[x]=w; } for(auto x:M){ V.push_back(x.second); } ll ans=0; ll s=0; for(ll i=0;i<V.size();i++){ if(s+V[i]>0){ s+=V[i]; }else{ s=0; } ans=max(ans,s); } cout<<ans; }
#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...