Codeforces Round #129 (Div. 2)

A. Little Elephant and Rozdil

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
struct town
{
    int time;
    int num;
}to[100001];
bool cmp(const struct town a,const struct town b)
{
    return a.time<b.time;
}
int main()
{
    int i,k,n;
    while(~scanf("%d",&n))
    {
        for(i=0;i<n;i++)
            {
                cin>>to[i].time;
                to[i].num=i+1;
            }
        sort(to,to+n,cmp);
        k=to[0].time;
        if(to[1].time==k) cout<<"Still Rozdil"<<endl;
        if(to[1].time!=k) cout<<to[0].num<<endl;

    }
    return 0;
}

B. Little Elephant and Sorting

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    long long data[100005],ans;
    int n,i;
    while(~scanf("%d",&n))
    {
        for(i=0;i<n;i++)
        {
            cin>>data[i];
        }
        for(i=0,ans=0;i<n-1;i++)
        {
            if(data[i]>data[i+1])
                ans=ans+data[i]-data[i+1];
        }
        cout<<ans<<endl;
    }
    return 0;
}