제출 #307350

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307350		limabeans	Bulldozer (JOI17_bulldozer)	C++17	5 / 100	1 ms	512 KiB

bulldozer

#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;




struct pt {
    ll x,y,w;
    void read() {
	cin>>x>>y>>w;
    }

    bool operator<(const pt& o) const {
	return make_pair(x,y) < make_pair(o.x,o.y);
    }
};

int n;
vector<pt> pts;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n;
    pts.resize(n);
    for (int i=0; i<n; i++) {
	pts[i].read();
	assert(pts[i].y == 0);
    }

    sort(pts.begin(),pts.end());

    ll best = 0;

    for (int i=0; i<n; i++) {
	ll cur = 0;
	for (int j=i; j<n; j++) {
	    cur += pts[j].w;
	    best = max(best, cur);
	}
    }

    cout<<best<<endl;    
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 20
• Subtask 3: 0 / 35
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20