| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 336130 | ScarletS | Schools (IZhO13_school) | C++17 | 125 ms | 9456 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
using namespace std;
bool cmp(pii& a, pii& b)
{
return a.f-a.s<b.f-b.s;
}
ll max(ll a, ll b)
{
if (a>b)
return a;
return b;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
int n,M,S;
ll sum=0,ans=0;
cin>>n>>M>>S;
pii a[n+2];
for (int i=1;i<=n;++i)
cin>>a[i].f>>a[i].s;
sort(a+1,a+n+1,cmp);
int b[n+2],c[n+2];
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||