Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int main()
- {
- int N,n,sum,k=0,j=0,maxt,maxk=0;
- cin>>N;
- int t[N][N];
- n=N;
- while(n)
- {
- for(int i=0;i<=j;i++)
- cin>>t[j][i];
- j++;
- n-=j;
- }
- j--;
- maxt=t[j][0];
- for(int i=1;i<j;i++)
- {
- if(t[j][i]>maxt)
- {
- maxt=t[j][i];
- maxk=i;
- }
- }
- sum=t[j][maxk];
- cout<<maxk<<endl;
- while(j--)
- {
- if(maxk)
- {
- if(maxk=j) maxk--;
- else
- {
- if(t[j][maxk-1]>t[j][maxk]) maxk--;
- }
- }
- sum+=t[j][maxk];
- }
- cout<<sum<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement