oj.uz

답안 #90793

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90793 2018-12-24T12:40:33 Z Nordway 학교 설립 (IZhO13_school) C++14
25 / 100
 231 ms 10216 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define all(v) v.begin(),v.end()
#define boost ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef pair<ll,ll> pll;

const ll INF = 1e18;
const ll inf = 1e9;
const int mod = 998244353;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};
const int N = 3e5+5;
const int M = 1e5+1;

int u[N],u2[N];
int a[N],b[N];
pii c[N];

int main(){
	int n,m,s;
	cin>>n>>m>>s;
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i];
		c[i]=mp(a[i]-b[i],i);
	}
	sort(c+1,c+n+1);
	reverse(c+1,c+n+1);
	ll ans1=0,ans2=0;
	for(int i=1;i<=m;i++){
		ans1+=a[c[i].y];
		u[c[i].y]=1;
	}
	vector<int>v;
	for(int i=1;i<=n;i++){
		if(!u[i]){
			v.pb(b[i]);
		}
	}
	sort(all(v));
	reverse(all(v));
	for(int i=0;i<s;i++){
		ans1+=v[i];
	}
	v.clear();
	for(int i=n;i>=n-s+1;i--){
		ans2+=b[c[i].y];
		u2[c[i].y]=1;
	}
	for(int i=1;i<=n;i++){
		if(!u2[i]){
			v.pb(a[i]);
		}
	}
	sort(all(v));
	reverse(all(v));
	for(int i=0;i<m;i++){
		ans2+=v[i];
	}
	cout<<max(ans1,ans2);
}

Subtask #1
25.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 2 ms 544 KB Output is correct
4 Incorrect 2 ms 568 KB Output isn't correct
5 Incorrect 2 ms 580 KB Output isn't correct
6 Incorrect 2 ms 588 KB Output isn't correct
7 Incorrect 5 ms 720 KB Output isn't correct
8 Correct 5 ms 940 KB Output is correct
9 Incorrect 5 ms 940 KB Output isn't correct
10 Incorrect 5 ms 940 KB Output isn't correct
11 Incorrect 5 ms 976 KB Output isn't correct
12 Incorrect 6 ms 1032 KB Output isn't correct
13 Incorrect 28 ms 2496 KB Output isn't correct
14 Incorrect 61 ms 3936 KB Output isn't correct
15 Incorrect 129 ms 5700 KB Output isn't correct
16 Correct 138 ms 7148 KB Output is correct
17 Incorrect 171 ms 8008 KB Output isn't correct
18 Incorrect 188 ms 8656 KB Output isn't correct
19 Incorrect 201 ms 9148 KB Output isn't correct
20 Incorrect 231 ms 10216 KB Output isn't correct