oj.uz

답안 #501567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
501567 2022-01-04T04:01:28 Z tmn2005 학교 설립 (IZhO13_school) C++17
15 / 100
 193 ms 28032 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b[N],c;

main(){
	NeedForSpeed
    cin>>n>>x>>y;
    
    priority_queue<pii>q, g, s, t;
    for(int i=1; i<=n; i++){
    	cin>>a[i]>>b[i];
    	q.push({a[i], b[i]});
    	g.push({b[i], a[i]});
	}
	l = x, r = y;
	while(l--){
		res += q.top().fr;
		q.pop();
	}
	while(r--){
		ans += g.top().fr;
		g.pop();
	}
	
	while(!q.empty()){
		s.push({q.top().sc, q.top().fr});
		
		q.pop();
	}
	while(!g.empty()){
		t.push({g.top().sc, g.top().fr});
		
		g.pop();
	}
	while(y--){
		res += s.top().fr;
		s.pop();
	}
	cout<<endl;
	while(x--){
		ans += t.top().fr;
		t.pop();
	}	
	cout<<max(res, ans)<<endl;
	
	




	return 0;
}

Compilation message

school.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~

Subtask #1
15.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 324 KB Output isn't correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Incorrect 0 ms 324 KB Output isn't correct
5 Incorrect 0 ms 332 KB Output isn't correct
6 Incorrect 0 ms 332 KB Output isn't correct
7 Incorrect 3 ms 824 KB Output isn't correct
8 Incorrect 3 ms 844 KB Output isn't correct
9 Incorrect 3 ms 844 KB Output isn't correct
10 Incorrect 3 ms 844 KB Output isn't correct
11 Incorrect 3 ms 844 KB Output isn't correct
12 Incorrect 4 ms 836 KB Output isn't correct
13 Incorrect 20 ms 3988 KB Output isn't correct
14 Incorrect 43 ms 7908 KB Output isn't correct
15 Correct 88 ms 18196 KB Output is correct
16 Incorrect 121 ms 16856 KB Output isn't correct
17 Incorrect 141 ms 19308 KB Output isn't correct
18 Incorrect 154 ms 22928 KB Output isn't correct
19 Incorrect 174 ms 24304 KB Output isn't correct
20 Incorrect 193 ms 28032 KB Output isn't correct