oj.uz

답안 #90931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90931 2018-12-25T08:50:13 Z kylych03 학교 설립 (IZhO13_school) C++14
100 / 100
 380 ms 27352 KB 
#include <bits/stdc++.h>
#define int long long
#define sc second
#define fr first
#define mp make_pair

using namespace std;
pair <int, pair<int, int> > ar[300001];
int pr[300002], sf[300002];
multiset < pair <int,int> > st1, st2;
main()
{
	int n,a,b;
	cin>>n>>a>>b;
	
	for(int i=0;i<n;i++){
		cin>>ar[i].sc.fr>>ar[i].sc.sc;
		ar[i].fr=ar[i].sc.sc - ar[i].sc.fr;
	}
	
	sort(ar,ar+n);
	int sum=0;
	for(int i=0;i<n;i++){
		if(i<a){
			sum+=ar[i].sc.fr;
			pr[i]=sum;
			st1.insert(mp(ar[i].sc.fr, i ) );
		}
		else{
			sum+=ar[i].sc.fr;
			st1.insert(mp(ar[i].sc.fr, i ) );
			sum-=(st1.begin()->first);
			pr[i]=sum;
			st1.erase(*st1.begin());
			
		}
	}
	sum=0;
	for(int i=n-1;i>=0;i--){
		if(n-b <= i){
			sum+=ar[i].sc.sc;
			sf[i]=sum;
			st2.insert(mp(ar[i].sc.sc,i));
		}
		else{
			sum+=ar[i].sc.sc;
			st2.insert(mp(ar[i].sc.sc,i));
			sum-=(st2.begin()->first);
			sf[i]=sum;
			st2.erase(*st2.begin());
		}
	}
	int mx=0;
	for(int i= max(0LL,a-1);i<n-b;i++)
		mx=max(pr[i] + sf[i+1],mx);
	if(a==0)
		mx=max(sf[0],mx);
	
	cout<<mx<<endl;	
}

Compilation message

school.cpp:11:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 6 ms 772 KB Output is correct
8 Correct 6 ms 1092 KB Output is correct
9 Correct 6 ms 1144 KB Output is correct
10 Correct 6 ms 1212 KB Output is correct
11 Correct 6 ms 1308 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 40 ms 4408 KB Output is correct
14 Correct 78 ms 5836 KB Output is correct
15 Correct 132 ms 7640 KB Output is correct
16 Correct 277 ms 19300 KB Output is correct
17 Correct 299 ms 21900 KB Output is correct
18 Correct 319 ms 21900 KB Output is correct
19 Correct 346 ms 24876 KB Output is correct
20 Correct 380 ms 27352 KB Output is correct