제출 #1195490

#제출 시각아이디문제언어결과실행 시간메모리
1195490adriines06Bulldozer (JOI17_bulldozer)C++20
5 / 100
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; void solve(){ ll n; cin>>n; vector<pair<ll,ll>>c(n),aux(n); vector<ll>w(n); for(ll i=0;i<n;i++){ cin>>c[i].first>>c[i].second>>w[i]; } for(ll i=0;i<n;i++){ aux[i].first=c[i].first; aux[i].second=i; } sort(aux.begin(),aux.end()); ll ans=0,s=0; for(ll i=0;i<n;i++){ for(ll j=i;j<n;j++){ ll ix=aux[j].second; s+=w[ix]; ans=max(ans,s); } s=0; } cout<<ans; } int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.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...