제출 #895786

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
895786		Minbaev	Art Exhibition (JOI18_art)	C++17	100 / 100	521 ms	54744 KiB

art

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e17 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}
void solve(){
	int n,m,k;
	
	cin>>n;
	
	vector<pii>v;
	map<int,int>mp;
	for(int i = 1;i<=n;i++){
		cin>>m>>k;
		mp[m] += k;
	}
	
	for(auto to:mp)
		v.pb(to);
	
	//~ for(auto to:v)cout<<to.s<<" ";
	
	int ans = -1 * mod;
	int sum = 0,lo = 0;
	
	for(int i = 0;i<v.size();i++){
		umin(lo,sum-v[i].f);
		sum += v[i].s;
		umax(ans,sum - v[i].f - lo);
	}
	cout<<ans<<"\n";
	
	
	
}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();

}
	

컴파일 시 표준 에러 (stderr) 메시지

art.cpp: In function 'void solve()':
art.cpp:50:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |  for(int i = 0;i<v.size();i++){
      |                ~^~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50