oj.uz

답안 #209617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
209617 2020-03-14T21:52:35 Z MohamedAhmed0 학교 설립 (IZhO13_school) C++14
100 / 100
 153 ms 17512 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 300000 + 10 ;

long long M[MAX] , S[MAX] ;
long long prefM[MAX] , suffS[MAX] ;
int n , m , s ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m>>s ;
	vector< pair<int , int> >vp ;
	for(int i = 0 ; i < n ; ++i)
	{
		cin>>M[i]>>S[i] ;
		vp.push_back({M[i]-S[i] , i}) ;
	}
	sort(vp.rbegin() , vp.rend()) ;
	priority_queue< long long , vector<long long> , greater<long long> >q ;
	long long sum = 0 ;
	for(int i = 0 ; i < n ; ++i)
	{
		int idx = vp[i].second ;
		if(q.size() < m)
		{
			sum += M[idx] ;
			q.push(M[idx]) ;
		}
		else if(q.top() < M[idx])
		{
			sum -= q.top() ;
			q.pop() ;
			sum += M[idx] ;
			q.push(M[idx]) ;
		}
		prefM[i] = sum ;
	}
	while(q.size() > 0)
		q.pop() ;
	sum = 0 ;
	for(int i = n-1 ; i >= 0 ; --i)
	{
		int idx = vp[i].second ;
		if(q.size() < s)
		{
			sum += S[idx] ;
			q.push(S[idx]) ;
		}
		else if(q.top() < S[idx])
		{
			sum -= q.top() ;
			q.pop() ;
			sum += S[idx] ;
			q.push(S[idx]) ;
		}
		suffS[i] = sum ;
	}
	long long ans = suffS[0] ;
	for(int i = 0 ; i < n ; ++i)
		ans = max(ans , prefM[i] + suffS[i+1]) ;
	return cout<<ans<<"\n" , 0 ;
}

Compilation message

school.cpp: In function 'int main()':
school.cpp:28:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(q.size() < m)
      ~~~~~~~~~^~~
school.cpp:48:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(q.size() < s)
      ~~~~~~~~~^~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 6 ms 636 KB Output is correct
8 Correct 7 ms 632 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 7 ms 760 KB Output is correct
11 Correct 6 ms 632 KB Output is correct
12 Correct 6 ms 632 KB Output is correct
13 Correct 21 ms 2672 KB Output is correct
14 Correct 37 ms 4720 KB Output is correct
15 Correct 62 ms 8424 KB Output is correct
16 Correct 86 ms 12136 KB Output is correct
17 Correct 119 ms 13288 KB Output is correct
18 Correct 125 ms 14312 KB Output is correct
19 Correct 135 ms 15336 KB Output is correct
20 Correct 153 ms 17512 KB Output is correct