oj.uz

답안 #1114317

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114317 2024-11-18T14:13:18 Z Tsagana 학교 설립 (IZhO13_school) C++14
0 / 100
 341 ms 18076 KB 
#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define lnl long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second

using namespace std;

vector<pair<int, int>> vx;
vector<pair<int, int>> vy;
vector<pair<int, int>> v;
int has[300001];

bool cmp(pair<int, int> a, pair<int, int> b) {return (a.F < b.F ? 0 : 1);}

void solve () {
	int n, m, s; cin >> n >> m >> s;

	for (int i = 0; i < n; i++) {
		int x, y; cin >> x >> y;
		v.pb({x, y});
		vx.pb({x, i});
		vy.pb({y, i});
	}
	sort(all(vx), cmp);
	sort(all(vy), cmp);

	int ans = 0, lx = m, ly = s;
	for(int i = 0; i < m; i++) {
		ans += vx[i].F;
		has[vx[i].S]++;
	}
	for(int i = 0; i < s; i++) {
		ans += vy[i].F;
		has[vy[i].S]++;
	}

	for (int i = 0; i < n; i++) {
		while (has[vx[lx].S]) lx++;
		while (has[vy[ly].S]) ly++;
		if (has[i] == 2) {
			if (v[i].F - vx[lx].F <= v[i].S - vy[ly].F) {
				ans -= v[i].F - vx[lx].F;
				has[lx]++;
			}
			else {
				ans -= v[i].S - vy[ly].F;
				has[ly]++;
			}
		}
	}
	cout << ans;
}
int main() {IOS solve(); return 0;}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Runtime error 2 ms 592 KB Execution killed with signal 11
3 Runtime error 2 ms 592 KB Execution killed with signal 11
4 Incorrect 1 ms 336 KB Output isn't correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Incorrect 1 ms 336 KB Output isn't correct
7 Incorrect 2 ms 592 KB Output isn't correct
8 Incorrect 2 ms 592 KB Output isn't correct
9 Incorrect 2 ms 592 KB Output isn't correct
10 Incorrect 2 ms 592 KB Output isn't correct
11 Incorrect 2 ms 592 KB Output isn't correct
12 Incorrect 3 ms 1012 KB Output isn't correct
13 Incorrect 13 ms 2000 KB Output isn't correct
14 Incorrect 29 ms 3524 KB Output isn't correct
15 Incorrect 61 ms 6560 KB Output isn't correct
16 Incorrect 70 ms 7328 KB Output isn't correct
17 Incorrect 236 ms 9120 KB Output isn't correct
18 Incorrect 241 ms 10284 KB Output isn't correct
19 Incorrect 275 ms 10576 KB Output isn't correct
20 Incorrect 341 ms 18076 KB Output isn't correct