Submission #84401

#	Time	Username	Problem	Language	Result	Execution time	Memory
84401		hamzqq9	Schools (IZhO13_school)	C++14	25 / 100	140 ms	9420 KiB

school

#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 2005000
#define MOD 1000000007
#define N 300005
#define M 1000005
#define LOG 18
#define KOK 4000000
using namespace std;

int se[N],n,a,b,x[N],y[N];
priority_queue<iii> dif;
ll ans;

int main() {

//	freopen("input.txt","r",stdin);	

	scanf("%d %d %d",&n,&a,&b);

	for(int i=1;i<=n;i++) {

		scanf("%d %d",&x[i],&y[i]);

		dif.push({{y[i]-x[i],x[i]},i});

		ans+=x[i];

	}

	for(int i=1;i<=b;i++) {

		iii x=dif.top();

		dif.pop();

		ans+=x.st.st;

		se[x.nd]=1;

	}

	priority_queue<int> q;

	for(int i=1;i<=n;i++) {

		if(se[i]) continue ;

		q.push(-x[i]);

	}

	for(int i=1;i<=n-a-b;i++) {

		ans-=-q.top();

		q.pop();

	}

	printf("%lld",ans);

}

Compilation message (stderr)

school.cpp: In function 'int main()':
school.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&n,&a,&b);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
school.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&x[i],&y[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 25 / 100