제출 #501580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
501580		tmn2005	학교 설립 (IZhO13_school)	C++17	25 / 100	2091 ms	26132 KiB

school

#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,l,r,o,ans,res,ok,mx,mn = INF;
vec<pair<int, pii>>v;

int get(multiset<pii> &s, multiset<pii> &t, int b, int a){
	int x = 0, y = 0;
	auto it = s.end();
	auto itr = t.end();
	
	while(a--){
		it--;
		x += it->sc;
	}
	while(b--){
		itr--;
		y += itr->fr;
	}
	ret x + y;
}
main(){
	NeedForSpeed
	int x, y;
    cin>>n>>x>>y;    
    for(int i=1; i<=n; i++){
    	cin>>l>>r;
    	v.pb(mk(l-r, mk(l, r)));
	}
	sort(all(v));
	multiset<pii>s, t;
	
	for(int i=0; i<y-1; i++){
		s.ins({v[i].sc.fr, v[i].sc.sc});
	}
	for(int i=y-1; i<n; i++){
		t.ins({v[i].sc.fr, v[i].sc.sc});
	}
	
	
	for(int i=y-1; i<n-x; i++){
		s.ins({v[i].sc.fr, v[i].sc.sc});
		t.erase(t.find({v[i].sc.fr, v[i].sc.sc}));
		
	//for(auto j : s)cout<<j.sc<<" ";cout<<endl;
	//for(auto j : t)cout<<j.fr<<" ";cout<<endl;
	
		//cout<<get(s, t, x, y)<<endl;
		res = max(res, get(s, t, x, y));
	}
	cout<<res<<endl;


	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 25 / 100