Submission #61801

#	Time	Username	Problem	Language	Result	Execution time	Memory
61801		KLPP	Bulldozer (JOI17_bulldozer)	C++14	5 / 100	2 ms	512 KiB

bulldozer

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long int lld;
typedef pair<pair<lld,lld>,lld> piii;


int main(){
	int n;
	scanf("%d",&n);
	piii arr[n];
	for(int i=0;i<n;i++){
		scanf("%lld %lld %lld",&arr[i].first.first,&arr[i].first.second,&arr[i].second);
	}sort(arr,arr+n);
	lld ans=0;
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			lld can=0;
			for(int k=i;k<=j;k++){
				can+=arr[k].second;
			}ans=max(ans,can);
		}
	}printf("%lld\n",ans);
		
	
	
	

	return 0;
}

Compilation message (stderr)

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
bulldozer.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld",&arr[i].first.first,&arr[i].first.second,&arr[i].second);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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