oj.uz

답안 #96221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96221 2019-02-07T08:45:15 Z Retro3014 학교 설립 (IZhO13_school) C++17
45 / 100
 169 ms 8164 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <queue>

using namespace std;
typedef long long ll;
#define MAX_N 300000

int N, M, S;
struct ST{
	ST (int x, int y) : x(x), y(y) {}
	int x, y;
	bool operator <(const ST &a)const{
		if(x==a.x)	return y<a.y;
		return x>a.x;
	}
};
vector<ST> v;
priority_queue<ll> pq;
struct S2{
	S2 (ll x, int y) : x(x), y(y) {}
	ll x;
	int y;
	bool operator <(const S2 &a)const{
		return a.x<x;
	}
};
priority_queue<S2> pq2;
ll ans;


bool chk[MAX_N+1];

int main(){
	scanf("%d%d%d", &N, &M, &S);
	for(int i=0; i<N; i++){
		int a, b;
		scanf("%d%d", &a, &b);
		v.push_back({a, b});
	}sort(v.begin(), v.end());
	//for(int i=0; i<N; i++){
	//	cout<<v[i].x<<' '<<v[i].y<<endl;
	//}cout<<endl;
	ll sum = 0;
	for(int i=0; i<M; i++){
		sum+=v[i].x;
		pq.push((ll)(v[i].y-v[i].x));
	}
	ll sum2 = 0;
	for(int i=M; i<N; i++){
		if(S==0)	continue;
		if(pq2.size()<S){
			pq2.push({(ll)v[i].y, i});	sum2+=(ll)v[i].y;
			chk[i] = true;
		}
		else{
			if(pq2.top().x<v[i].y){
				sum2-=pq2.top().x; sum2+=(ll)v[i].y;
				chk[pq2.top().y] = false; chk[i] = true;
				pq2.pop(); pq2.push({v[i].y, i});
			}
		}
	}
	for(int i=0; i<=S; i++){
		ans = max(ans, sum+sum2);
		if(i==S)	continue;
		sum += (ll)v[M+i].x;
		pq.push((ll)(v[M+i].y-v[M+i].x));
		//cout<<'&'<<pq.top()<<endl;
		sum += pq.top(); pq.pop();
		if(chk[M+i]){
			sum2 -= (ll)v[M+i].y;
		}else{
			//cout<<'*'<<pq2.top().x<<endl;
			sum2 -= pq2.top().x;
			chk[pq2.top().y] = false;
			pq2.pop();
		}
	}
	printf("%lld", ans);
	return 0;
}

Compilation message

school.cpp: In function 'int main()':
school.cpp:54:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(pq2.size()<S){
      ~~~~~~~~~~^~
school.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &N, &M, &S);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
school.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
45.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 256 KB Output isn't correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Incorrect 3 ms 376 KB Output isn't correct
10 Incorrect 3 ms 376 KB Output isn't correct
11 Incorrect 4 ms 504 KB Output isn't correct
12 Incorrect 4 ms 504 KB Output isn't correct
13 Incorrect 14 ms 1136 KB Output isn't correct
14 Incorrect 34 ms 1904 KB Output isn't correct
15 Correct 54 ms 2536 KB Output is correct
16 Correct 73 ms 8164 KB Output is correct
17 Incorrect 129 ms 6628 KB Output isn't correct
18 Incorrect 103 ms 6372 KB Output isn't correct
19 Incorrect 109 ms 7012 KB Output isn't correct
20 Incorrect 169 ms 7516 KB Output isn't correct