Submission #501567

#	Time	Username	Problem	Language	Result	Execution time	Memory
501567		tmn2005	Schools (IZhO13_school)	C++17	15 / 100	193 ms	28032 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,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 (stderr)

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

• Subtask 1: 15 / 100