Codeforces Round #322 (Div. 2)

太蒟蒻……

---

A

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int main()
{
    int a,b;
    scanf("%d%d",&a,&b);
    if(a>b)swap(a,b);
    printf("%d %d",a,(b-a)/2);
    return 0;
}

---

B

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=200010;

int q[maxn],a[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    int max=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    for(int i=n;i>=1;i--)
    {
        if(a[i]>max){q[i]=0;max=a[i];}
        else {q[i]=max-a[i]+1;}
    }
    for(int i=1;i<=n;i++)printf("%d ",q[i]);
        return 0;
}

---

C

    #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=100010;

int a[maxn],q[maxn],cnt;
int main()
{
    int n,p,ans=0,left=0;
    scanf("%d%d",&n,&p);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        ans+=a[i]/10;
        if(a[i]%10)
        q[cnt++]=10-a[i]%10;
        left+=(100-a[i])/10;
    }
    sort(q,q+cnt);
    int w=0;
    while(p-q[w]>=0&&w<cnt){p-=q[w++];ans++;}
    ans+=min(p/10,left);
    printf("%d",ans);
    return 0;
}